Related papers: A uniformness conjecture of the Kolakoski sequence…

The Kolakoski sequence is the unique infinite sequence with values in $\{1, 2\}$ and first term twems $1, 2, \ldots$ which equals the sequence of run-lengths of itself, we call this $K(1, 2).$ We define $K(m, n)$ similarly for $m+n$ odd. A…

The Kolakoski sequence $S$ is the unique element of $\left\lbrace 1,2 \right\rbrace^{\omega}$ starting with 1 and coinciding with its own run length encoding. We use the parity of the lengths of particular subclasses of initial words of $S$…

The Oldenburger-Kolakoski sequence is the only infinite sequence over the alphabet $\{1,2\}$ that starts with $1$ and is its own run-length encoding. In the present work, we take a step back from this largely known and studied sequence by…

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine…

Bollob\'{a}s and Thomason (1985) proved that for each $k=k(n) \in [1, n-1]$, with high probability, the random graph process, where edges are added to vertex set $V=[n]$ uniformly at random one after another, is such that the stopping time…

We present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a certain range. For degree sequence $(d_i)_{i=1}^n$ with maximum degree $d_{\max}=O(m^{1/4-\tau})$, our algorithm…

Bassino et al. (arXiv:1907.08517) have shown that uniform random co-graphs (graphs without induced $P_4$) of size $n$ converge to a certain non-deterministic graphon. The edge-density of this graphon is a random variable $\Lambda \in [0,1]$…

A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…

The Kolakoski sequence K(1,3) over {1, 3} is known to be structured, unlike K(1,2), with symbol frequency d approx. 0.397 linked to the Pisot number alpha (real root of x^3 - 2x^2 - 1 = 0). We reveal an explicit nested recursion defining…

For positive integers $n,k$ and $t$, the uniform subset graph $G(n, k, t)$ has all $k$-subsets of $\{1,2,\ldots, n\}$ as vertices and two $k$-subsets are joined by an edge if they intersect at exactly $t$ elements. The Johnson graph…

In this paper new binary sequence families $\mathcal{F}^k$ of period $2^n-1$ are constructed for even $n$ and any $k$ with ${\rm gcd}(k,n)=2$ if $n/2$ is odd or ${\rm gcd}(k,n)=1$ if $n/2$ is even. The distribution of their correlation…

Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

We consider (generalized) Kolakoski sequences on an alphabet with two even numbers. They can be related to a primitive substitution rule of constant length ell. Using this connection, we prove that they have pure point dynamical and pure…

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…