Related papers: Asymptotic repetitive threshold of balanced sequen…

Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots,…

For a finite set of points $X$ on the unit hypersphere in $\mathbb{R}^d$ we consider the iteration $u_{i+1}=u_i+\chi_i$, where $\chi_i$ is the point of $X$ farthest from $u_i$. Restricting to the case where the origin is contained in the…

Let $\bm X=(X_1,...,X_d)$ be a random vector, whose components are not necessarily independent nor are they required to have identical distribution functions $F_1,...,F_d$. Denote by $N_s$ the number of exceedances among $X_1,...,X_d$ above…

A non-empty word $w$ is a border of the word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ with the border $w$ is closed if $u$ has exactly two occurrences of $w$. A word $u$ is privileged if…

Let $[n]=\{1, \ldots, n\}$. A sequence $u=a_1a_2\dots a_l$ over $[n]$ is called $k$-sparse if $a_i = a_j$, $i > j$ implies $i-j\geq k$. In other words, every consecutive subsequence of $u$ of length at most $k$ does not have letters in…

Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…

The sequence starts with a(1) = 1; to extend it one writes the sequence so far as XY^k, where X and Y are strings of integers, Y is nonempty and k is as large as possible: then the next term is k. The sequence begins 1, 1, 2, 1, 1, 2, 2, 2,…

For phase transitions in disordered systems, an exact theorem provides a bound on the finite size correlation length exponent: \nu_{FS}<= 2/d. It is believed that the true critical exponent \nu of a disorder induced phase transition…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$. The graph $G$ is assumed to have average degrees at least $n^{1/3 + \varepsilon}$ for some $\varepsilon > 0$, and to have…

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which…

This work is motivated by the problem of error correction in bit-shift channels with the so-called $ (d,k) $ input constraints (where successive $ 1 $'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0 \leq d < k…

We construct a sequence that converges to a solution of the Cauchy problem for a singularly perturbed linear inhomogeneous differential equation of an arbitrary order. This sequence is also an asymptotic sequence in the following sense: the…

We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Let $G$ be a finite additive abelian group with exponent $d^kn, d,n>1,$ and $k$ a positive integer. For $S$ a sequence over $G$ and $A=\{1,2,\ldots,d^kn-1\}\setminus\{d^kn/d^i:i\in[1,k]\}, $ we investigate the lower bound of the number…

The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let $D(N)$ denote the number of such prime decompositions for an even $N$. It is known that $D(N)$ can be bounded above by $$ D(N) \leq C^*…

For a given quadratic irrational $\alpha$, let us denote by $D(\alpha)$ the length of the periodic part of the continued fraction expansion of $\alpha$. We prove that for a positive integer $d$, which is not a perfect square, the sequence…

For an infinite word $x$, Bugeaud and Kim introduced a quantity $\mathrm{rep}(x)$ called the exponent of repetition of $x$. We prove that $\mathrm{rep}(x) = \mathrm{rep}(y)$ holds for a Sturmian word $x$ and every suffix $y$ of $x$. Let $c$…