Related papers: Gap Sequence of Cutting Sequence with Slope $\thet…
Let $\omega$ be a factor of Doubling sequence $D_\infty=x_1x_2\cdots$, then it occurs in the sequence infinitely many times. Let $\omega_p$ be the $p$-th occurrence of $\omega$ and $G_p(\omega)$ be the gap between $\omega_p$ and…
Let w be a factor of Fibonacci sequence F=x_1x_2..., then it appears in the sequence infinitely many times. Let w_p be the p-th appearance of w and v_{w,p} be the gap between w_p and w_{p+1}. In this paper, we discuss the structure of the…
We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…
We consider the infinite one-sided sequence generated by the period-doubling substitution $\sigma(a,b)=(ab,aa)$, denoted by $\mathbb{D}$. Since $\mathbb{D}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the…
Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…
Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…
A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…
The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…
Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…
The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of $L^{1}$-functions). Dole\v{z}al and Hladk\'y [J. Combin. Theory Ser. B 137…
In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…
Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient…
Negative type inequalities arise in the study of embedding properties of metric spaces, but they often reduce to intractable combinatorial problems. In this paper we study more quantitative versions of these inequalities involving the…
An interesting characterization of the Fibonacci numbers is that, if we write them as $F_1 = 1$, $F_2 = 2$, $F_3 = 3$, $F_4 = 5, ...$, then every positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. This is…
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…
Let F be a family of Borel measurable functions on a complete separable metric space. The gap (or fat-shattering) dimension of F is a combinatorial quantity that measures the extent to which functions f in F can separate finite sets of…
We investigate gaps of $n$-term arithmetic progressions $x, x+y, \ldots, x+(n-1)y$ inside a positive measure subset $A$ of the unit cube $[0,1]^d$. If lengths of their gaps $y$ are evaluated in the $\ell^p$-norm for any $p$ other than $1,…
We consider Schr\"odinger operators with dynamically defined potentials arising from continuous sampling along orbits of strictly ergodic transformations. The Gap Labeling Theorem states that the possible gaps in the spectrum can be…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…