Related papers: Envelope Word and Gap Sequence in Doubling Sequenc…

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…

For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a…

We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.

In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup $G_n$ of the symmetric group $S_n$, it acts on the set of finite words of length $n$ by permutation. We associate to an infinite…

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.

We prove an Erd\H{o}s--Szekeres type result for finite words over $\mathbb{N}$ with repeated values. Specifically, we define a \emph{repeat} in a word to be an occurrence of a value which is not its first occurrence. We define an occurrence…

Recursive reasoning systems alternate between acquiring new evidence and refining an accumulated understanding. Two design choices are typically left implicit: how to represent the evolving reasoning state, and when to stop iterating. This…

We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…

First, we construct the Jones tower and tunnel of the central sequence subfactor arising from a hyperfinite type II_1 subfactor with finite index and finite depth, and prove each algebra has the double commutant property in the ultraproduct…

Let d \geq d_0 be a sufficiently large constant. A (n,d,c \sqrt{d}) graph G is a d-regular graph over n vertices whose second largest (in absolute value) eigenvalue is at most c \sqrt{d}. For any 0 < p < 1, G_p is the graph induced by…

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…

Let kappa be the limit of <kappa_n : n<omega> (1) if each kappa_n carries an extender of the length of the first Mahlo above kappa_n, then for every ld above kappa there is a generic extension with power of kappa above ld. (2) if each…

Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq…

We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.

Motivated by a question of S\'ark\"ozy, we study the gaps in the product sequence $\B=\A ... \A=\{b_n=a_ia_j, a_i,a_j\in \A\}$ when $\A$ has upper Banach density $\alpha>0$. We prove that there are infinitely many gaps $b_{n+1}-b_n\ll…

Factorial moments are convenient tools in particle physics to characterize the multiplicity distributions when phase-space resolution ($\Delta$) becomes small. They include all correlations within the system of particles and represent…

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular spanning subgraphs $F_1,\ldots, F_k$, called factors. The classic Oberwolfach problem corresponds to the case when all of the factors are…