Searcharxiv⌕ Search

arXiv subjects

Svetlana Puzynina

Publications and source records attributed to Svetlana Puzynina.

31 records · Page 2Linked to original sources

On a group theoretic generalization of the Morse-Hedlund theorem

In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word $x\in A^N,$ over a non empty finite alphabet $A,$ contains at least $n+1$ distinct factors of each length $n.$ They further showed that an infinite word $x$ has exactly $n+1$ distinct factors of each length $n$ if and only if $x$ is binary, aperiodic and balanced, i.e., $x$ is a Sturmian word. In this paper we obtain a broad generalization of the Morse-Hedlund theorem via group actions. Given a subgroup $G$ of the symmetric group $S_n, $ let $1\leq ε(G)\leq n$ denote the number of distinct $G$-orbits of $\{1,2,\ldots ,n\}.$ Since $G$ is a subgroup of $S_n,$ it acts on $A^n=\{a_1a_2\cdots a_n\,|\,a_i\in A\}$ by permutation. Thus, given an infinite word $x\in A^N$ and an infinite sequence $ω=(G_n)_{n\geq 1}$ of subgroups $G_n \subseteq S_n,$ we consider the complexity function $p_{ω,x}:N \rightarrow N$ which counts for each length $n$ the number of equivalence classes of factors of $x$ of length $n$ under the action of $G_n.$ We show that if $x$ is aperiodic, then $p_{ω, x}(n)\geqε(G_n)+1$ for each $n\geq 1,$ and moreover, if equality holds for each $n,$ then $x$ is Sturmian. Conversely, let $x$ be a Sturmian word. Then for every infinite sequence $ω=(G_n)_{n\geq 1}$ of Abelian subgroups $G_n \subseteq S_n,$ there exists $ω'=(G_n')_{n\geq 1}$ such that for each $n\geq 1:$ $G_n'\subseteq S_n$ is isomorphic to $G_n$ and $p_{ω',x}(n)=ε(G'_n)+1.$ Applying the above results to the sequence $(Id_n)_{n\geq 1},$ where $Id_n$ is the trivial subgroup of $S_n$ consisting only of the identity, we recover both directions of the Morse-Hedland theorem.

math.CO↗

Abelian bordered factors and periodicity

A finite word u is said to be bordered if u has a proper prefix which is also a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely periodic if and only if it contains only finitely many unbordered factors. We are interested in abelian and weak abelian analogues of this result; namely, we investigate the following question(s): Let w be an infinite word such that all sufficiently long factors are (weakly) abelian bordered; is w (weakly) abelian periodic? In the process we answer a question of Avgustinovich et al. concerning the abelian critical factorization theorem.

cs.FL↗

Aperiodic pseudorandom number generators based on infinite words

In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the \emph{well distributed occurrences} (WELLDOC) combinatorial property for infinite words, which guarantees absence of the lattice structure defect in related pseudorandom number generators. An infinite word $u$ on a $d$-ary alphabet has the WELLDOC property if, for each factor $w$ of $u$, positive integer $m$, and vector $\mathbf v\in\mathbb Z_{m}^{d}$, there is an occurrence of $w$ such that the Parikh vector of the prefix of $u$ preceding such occurrence is congruent to $\mathbf v$ modulo $m$. (The Parikh vector of a finite word $v$ over an alphabet $\mathcal A$ has its $i$-th component equal to the number of occurrences of the $i$-th letter of $\mathcal A$ in $v$.) We prove that Sturmian words, and more generally Arnoux-Rauzy words and some morphic images of them, have the WELLDOC property. Using the TestU01 and PractRand statistical tests, we moreover show that not only the lattice structure is absent, but also other important properties of PRNGs are improved when linear congruential generators are combined using infinite words having the WELLDOC property.

math.CO↗

Infinite Self-Shuffling Words

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 U_i^{(1)}\cdots U_i^{(k)}=\prod_{i=0}^\infty U_i^{(1)}=\cdots =\prod_{i=0}^\infty U_i^{(k)}$. In other words, there exists a shuffle of $k$-copies of $x$ which produces $x$. We are particularly interested in the case $k=2$, in which case we say $x$ is self-shuffling. This property of infinite words is shown to be an intrinsic property of the word and not of its language (set of factors). For instance, every aperiodic word contains a non self-shuffling word in its shift orbit closure. While the property of being self-shuffling is a relatively strong condition, many important words arising in the area of symbolic dynamics are verified to be self-shuffling. They include for instance the Thue-Morse word and all Sturmian words of intercept $0<ρ<1$ (while those of intercept $ρ=0$ are not self-shuffling). Our characterization of self-shuffling Sturmian words can be interpreted arithmetically in terms of a dynamical embedding and defines an arithmetic process we call the {\it stepping stone model}. One important feature of self-shuffling words stems from its morphic invariance, which provides a useful tool for showing that one word is not the morphic image of another. The notion of self-shuffling has other unexpected applications particularly in the area of substitutive dynamical systems. For example, as a consequence of our characterization of self-shuffling Sturmian words, we recover a number theoretic result, originally due to Yasutomi, on a classification of pure morphic Sturmian words in the orbit of the characteristic.

math.CO↗

Infinite square-free self-shuffling words

In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word $w$ is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for some finite words $U_i$, $V_i$. Harju recently asked whether square-free self-shuffling words exist. We answer this question affirmatively. Besides that, we build an infinite word such that no word in its shift orbit closure is self-shuffling, answering positively a question from Charlier et al.

cs.DM↗

On additive properties of sets defined by the Thue-Morse word

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq F\subseteq {1,2,...,k\} \big}$ for some $k$-term sequence of natural numbers $x_1<x_2 < ... < x_k$. We say $A \subseteq \nats$ is finite FS-big if $A$ is $k$-summable for each positive integer $k$. We say is $A \subseteq \nats$ is infinite FS-big if for each positive integer $k,$ $A$ contains ${\sum_{n\in F}x_n | \emp\neq F\subseteq \nats and #F\leq k}$ for some infinite sequence of natural numbers $x_1<x_2 < ... $. We say $A\subseteq \nats $ is an IP-set if $A$ contains ${\sum_{n\in F}x_n | \emp\neq F\subseteq \nats and #F<\infty}$ for some infinite sequence of natural numbers $x_1<x_2 < ... $. By the Finite Sums Theorem [5], the collection of all IP-sets is partition regular, i.e., if $A$ is an IP-set then for any finite partition of $A$, one cell of the partition is an IP-set. Here we prove that the collection of all finite FS-big sets is also partition regular. Let $\TM =011010011001011010... $ denote the Thue-Morse word fixed by the morphism $0\mapsto 01$ and $1\mapsto 10$. For each factor $u$ of $\TM$ we consider the set $\TM\big|_u\subseteq \nats$ of all occurrences of $u$ in $\TM$. In this note we characterize the sets $\TM\big|_u$ in terms of the additive properties defined above. Using the Thue-Morse word we show that the collection of all infinite FS-big sets is not partition regular.

math.CO↗

Weak abelian periodicity of infinite words

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency. We establish necessary and sufficient conditions for weak abelian periodicity of fixed points of uniform binary morphisms. Also, we discuss weak abelian periodicity in minimal subshifts.

math.CO↗

Central sets defined by words of low factor complexity

A subset $A$ of $\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing additional nice combinatorial properties: Each central set contains arbitrarily long arithmetic progressions, and solutions to all partition regular systems of homogeneous linear equations. In this paper we show how certain families of aperiodic words of low factor complexity may be used to generate a wide assortment of central sets having additional nice properties inherited from the rich combinatorial structure of the underlying word. We consider Sturmian words and their extensions to higher alphabets (so-called Arnoux-Rauzy words), as well as words generated by substitution rules including the famous Thue-Morse word. We also describe a connection between central sets and the strong coincidence condition for fixed points of primitive substitutions which represents a new approach to the strong coincidence conjecture for irreducible Pisot substitutions. Our methods simultaneously exploit the general theory of combinatorics on words, the arithmetic properties of abstract numeration systems defined by substitution rules, notions from topological dynamics including proximality and equicontinuity, the spectral theory of symbolic dynamical systems, and the beautiful and elegant theory, developed by N. Hindman, D. Strauss and others, linking IP-sets to the algebraic/topological properties of the Stone-Čech compactification of $\mathbb{N}.$ Using the key notion of $p$-$\lim_n,$ regarded as a mapping from words to words, we apply ideas from combinatorics on words in the framework of ultrafilters.

math.CO↗

Central sets generated by uniformly recurrent words

A subset $A$ of $\nats$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \nats} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing rich combinatorial properties: Each central set contains arbitrarily long arithmetic progressions, and solutions to all partition regular systems of homogeneous linear equations. In this paper we investigate central sets in the framework of combinatorics on words. Using various families of uniformly recurrent words, including Sturmian words, the Thue-Morse word and fixed points of weak mixing substitutions, we generate an assortment of central sets which reflect the rich combinatorial structure of the underlying words. The results in this paper rely on interactions between different areas of mathematics, some of which had not previously been directly linked. They include the general theory of combinatorics on words, abstract numeration systems, and the beautiful theory, developed by Hindman, Strauss and others, linking IP-sets and central sets to the algebraic/topological properties of the Stone-Čech compactification of $\nats .$

math.CO↗

On minimal factorizations of words as products of palindromes

Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic word w and a positive integer P such that |u|_{pal} P. In particular, the result holds for all the k-power-free words and for the Sierpinski word.

math.CO↗

Abelian returns in Sturmian words

Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of its factors has two or three abelian (or semi-abelian) returns. We study the structure of abelian returns in Sturmian words and give a characterization of those factors having exactly two abelian returns. Finally we discuss connections between abelian returns and periodicity in words.

math.CO↗

A regularity lemma and twins in words

For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, Σ) = \min \{f(S): S \text{is of length} n, \text{over alphabet} Σ\}$. Here, it is shown that \[2f(n, \{0,1\}) = n-o(n)\] using the regularity lemma for words. I.e., any binary word of length $n$ can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length $o(n)$. A similar result is proven for $k$ identical subwords of a word over an alphabet with at most $k$ letters.

math.CO↗

Abelian returns in Sturmian words

In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or three abelian returns. In addition, we describe the structure of abelian returns in Sturmian words, and discuss connections between abelian returns and periodicity.

cs.FL↗