Results 81 to 90 of about 3,173 (190)

A generalization of the carries process [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We consider a carries process which is a generalization of that by Holte in the sense that (i) we take various digit sets, and (ii) we also consider negative base. Our results are : (i) eigenvalues and eigenvectors of the transition probability matrices,
Takahiko Fujita   +2 more
doaj   +1 more source

Random Burning of the Euclidean Torus

open access: yesRandom Structures &Algorithms, Volume 69, Issue 4, December 2026.
ABSTRACT The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph.
Guillaume Blanc, Alice Contat
wiley   +1 more source

Random Turán Problems for Hypergraph Expansions

open access: yesRandom Structures &Algorithms, Volume 69, Issue 4, December 2026.
ABSTRACT Given an r0$$ {r}_0 $$‐uniform hypergraph F$$ F $$, we define its r$$ r $$‐uniform expansion F(r)$$ {F}^{(r)} $$ to be the hypergraph obtained from F$$ F $$ by inserting r−r0$$ r-{r}_0 $$ distinct vertices into each edge of F$$ F $$, and we define ex(Gn,pr,F(r))$$ \mathrm{ex}\left({G}_{n,p}^r,{F}^{(r)}\right) $$ to be the largest F(r)$$ {F ...
Jiaxi Nie, Sam Spiro
wiley   +1 more source

On Almost Gallai Colorings in Complete Graphs

open access: yesRandom Structures &Algorithms, Volume 69, Issue 4, December 2026.
ABSTRACT We investigate a rainbow analog of the Ruzsa–Szemerédi problem. For t∈ℕ$$ t\in \mathbb{N} $$, we say that a coloring of E(Kn)$$ E\left({K}_n\right) $$ is almost t$$ t $$‐Gallai if no two rainbow t$$ t $$‐cliques share an edge. Motivated by a lemma of Berkowitz on bounding the modulus of the characteristic function of clique counts in random ...
Alexandr Grebennikov   +2 more
wiley   +1 more source

On the Mixing Time of Glauber Dynamics for the Hard‐Core and Related Models on G(n,d/n)$$ G\left(n,d/n\right) $$

open access: yesRandom Structures &Algorithms, Volume 69, Issue 4, December 2026.
ABSTRACT In this work, we study the mixing time of the single‐site Glauber dynamics for the Hard‐core model on the sparse random graph G(n,d/n)$$ G\left(n,d/n\right) $$ with fugacity λ$$ \lambda $$. We show that for the typical instances of G(n,d/n)$$ G\left(n,d/n\right) $$ and for fugacity λ
Charilaos Efthymiou, Weiming Feng
wiley   +1 more source

Geometric and dosimetric effects of an automated clustering and plan optimization pipeline for multiple brain metastasis radiosurgery

open access: yesJournal of Applied Clinical Medical Physics, Volume 27, Issue 11, November 2026.
Abstract Background Treating multiple brain metastases simultaneously with single‐isocenter multi‐target (SIMT) stereotactic radiosurgery (SRS) can streamline treatment planning and delivery. However, it can also result in targets at large distances from the isocenter, increasing sensitivity to rotational setup errors and requiring wider collimator ...
Adam D. Yock   +4 more
wiley   +1 more source

Linear Versus Centred Colouring via Pseudogrids

open access: yesJournal of Graph Theory, Volume 113, Issue 3, Page 448-461, November 2026.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique.
Prosenjit Bose   +4 more
wiley   +1 more source

Logic and Discrete Mathematics A Concise Introduction

open access: yes, 2014
A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has ...
Goranko, Valentin, Conradie, Willem
core  

Undergraduate Seminar in Discrete Mathematics

open access: yes, 2006
This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent ...
Kleitman, Daniel
core  

Discrete Structures

open access: yes, 2004
CSC 133. Discrete Structures (4) Prerequisite: MAT 111 or MAT 115, or equivalent. Introduction to discrete mathematics applicable to computer science. Propositional and predicate logic, basic proof techniques, set algebra and Boolean algebra, recursion ...
Norris, Fletcher
core   +1 more source

Home - About - Disclaimer - Privacy