Related papers: $\omega$-Lyndon words

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene…

Smooth words over an alphabet of non-negative integers $\{a,b\}$ are infinite words that are infinitely derivable, the most famous example being the Oldenburger-Kolakoski word over $\{1,2\}$. The main way to study their language is to…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…

Let $A$ and $B$ be sets of words of length $n$ over some finite alphabet. Suppose that no suffix of a word in $A$ coincides with a prefix of a word in $B$. Then we show that the product of densities of $A$ and $B$ is upper bounded by…

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural…

We transform the method of Glasson into a sufficient condition under which a monoid is non-finitely related, add a new member to the collection of interlocking word-patterns, and use it to show that the monoid $M(ab^2a, a^2b^2)$ is…

Let w be a multilinear commutator word. We prove that if e is a positive integer and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e then the exponent of the corresponding verbal subgroup…

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

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…

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We consider (logical) reasoning for regular expressions with lookahead (REwLA). In this paper, we give an axiomatic characterization for both the (match-)language equivalence and the largest substitution-closed equivalence that is sound for…

We say a finite word $x$ is a palindromic periodicity if there exist two palindromes $p$ and $s$ such that $|x| \geq |ps|$ and $x$ is a prefix of the word $(ps)^\omega = pspsps\cdots$. In this paper we examine the palindromic periodicities…

Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…

A necessary and sufficient condition ("nonresonance") is established for every solution of an autonomous linear difference equation, or more generally for every sequence $(x^\top A^n y)$ with $x,y\in \mathbb{R}^d$ and $A\in…

A language $L$ over an alphabet $\Sigma$ is suffix-convex if, for any words $x,y,z\in\Sigma^*$, whenever $z$ and $xyz$ are in $L$, then so is $yz$. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and…

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…