Related papers: Minimal number of restrictions defining a periodic…
This work describes the number of restricted finite words in the alphabet A={a,b} required to identify an infinite word with some period n in the set of all infinite words in this alphabet given up to a shift. Also reviewed the case of…
We determine the maximal length of the period of a periodic word defined by $n$ restrictions. It happens to be the corresponding Fibonacci number.
We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…
From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior.…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for…
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.
It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism…