相关论文: Words avoiding 7/3-powers and the Thue-Morse morph…
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word bordered, if it has a proper prefix which is also a suffix of…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free…
We prove that every $2$-local automorphism on a finite-dimensional semi-simple Lie algebra $\mathcal{L}$ over an algebraically closed field of characteristic zero is an automorphism. We also show that each finite-dimensional nilpotent Lie…
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…
By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…
In work by Freedman [F2] and Freedman-Quinn [FQ] on the topology of 4-manifolds, null decompositions whose non-singleton elements are, in the terminology of [MOR], recursively starlike-equivalent sets of filtration length 1 arise and are…
We study the properties of the ternary infinite word p = 012102101021012101021012 ... , that is, the fixed point of the map h:0->01, 1->21, 2->0. We determine its factor complexity, critical exponent, and prove that it is 2-balanced. We…
We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…
A word $u$ defined over an alphabet $\mathcal{A}$ is $c$-balanced ($c\in\mathbb{N}$) if for all pairs of factors $v$, $w$ of $u$ of the same length and for all letters $a\in\mathcal{A}$, the difference between the number of letters $a$ in…
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…
A bidimensional bifix (in short bibifix) of a square matrix T is a square submatrix of T which occurs in the top-left and bottom-right corners of T. This allows us to extend the definition of bifix-free words and cross-bifix-free set of…
Univoque numbers are real numbers $\lambda > 1$ such that the number 1 admits a unique expansion in base $\lambda$, i.e., a unique expansion $1 = \sum_{j \geq 0} a_j \lambda^{-(j+1)}$, with $a_j \in \{0, 1, ..., \lceil \lambda \rceil -1\}$…
A \emph{morphism} is a mapping that transforms words through letter-wise substitution, where each symbol is consistently replaced by a fixed word. In the field of combinatorics on words, one topic that has attracted considerable attention…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\sqrt{2}/2$…
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…
We introduce and geometrically characterize the notion of uniformly perfect Morse boundary for proper geodesic metric spaces. As a unifying result, we prove that the Morse boundary of any finitely generated, non-elementary group is…