Related papers: Recurrence along directions in multidimensional wo…
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…
We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one of its interior letters creates a square (respectively, overlap,…
The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…
We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove…
In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…
In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
A square is a concatenation of two identical words, and a word $w$ is said to have a square $yy$ if $w$ can be written as $xyyz$ for some words $x$ and $z$. It is known that the ratio of the number of distinct squares in a word to its…
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
A word $w$ over an alphabet $\Sigma$ is a Lyndon word if there exists an order defined on $\Sigma$ for which $w$ is lexicographically smaller than all of its conjugates (other than itself). We introduce and study \emph{universal Lyndon…
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…
An infinite word x is said to be quasiperiodic if there exists a finite word q such that x is covered by occurrences of q (such a q is called a quasiperiod of x). Using the notion of derivation, we show that this definition is not…
In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…