Related papers: WELLDOC property for words generated by morphisms
A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…
Let $W$ be an irreducible affine Weyl group, and let $\mathsf{b}$ be a finite word over the alphabet of simple reflections of $W$. Fix a probability $p\in(0,1)$. For each integer $K\geq 0$, let $\mathsf{sub}_p(\mathsf{b}^K)$ be the random…
In this work, we combine the research on (absent) scattered factors with the one of jumbled words. For instance, $\mathtt{wolf}$ is an absent scattered factor of $\mathtt{cauliflower}$ but since $\mathtt{lfow}$, a jumbled (or abelian)…
Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…
Consider a quartic $q$-Weil polynomial $f$. Motivated by equidistribution considerations we define, for each prime $\ell$, a local factor which measures the relative frequency with which $f\bmod \ell$ occurs as the characteristic polynomial…
Understanding the reasons behind the exceptional success of transformers requires a better analysis of why attention layers are suitable for NLP tasks. In particular, such tasks require predictive models to capture contextual meaning which…
A \emph{palindrome} is a word that reads the same forwards and backwards. A \emph{block palindrome factorization} (or \emph{BP-factorization}) is a factorization of a word into blocks that becomes palindrome if each identical block is…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
Answering a question of G. Fici, we give an $S$-adic characterization of thefamily of infinite LSP words, that is, the family of infinite words having all their left special factors as prefixes.More precisely we provide a finite set of…
A word $w_1w_2\cdots w_n$ is said to be up-down if $w_1 < w_2 >w_3 \cdots$. Carlitz and Scoville found the generating function for the number of up-down words over an alphabet of size $k$. Using properties of the Chebyshev polynomials we…
We characterize the infinite words determined by indexed languages. An infinite language $L$ determines an infinite word $\alpha$ if every string in $L$ is a prefix of $\alpha$. If $L$ is regular or context-free, it is known that $\alpha$…
Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…
Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of even or…
Let $V$ be a plane smooth cubic curve over a finitely generated field $k.$ The Mordell-Weil theorem for $V$ states that there is a finite subset $P\subset V(k)$ such that the whole $V(k)$ can be obtained from $P$ by drawing secants and…
Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…
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…
In this paper, we study the pattern occurrence in $k$-ary words. We prove an explicit upper bound on the number of $k$-ary words avoiding any given pattern using a random walk argument. Additionally, we reproduce several already known…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist…