English
Related papers

Related papers: Every nonnegative real number is an abelian critic…

200 papers

Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of…

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…

Discrete Mathematics · Computer Science 2017-02-27 Gabriele Fici , Filippo Mignosi , Jeffrey Shallit

The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is…

Formal Languages and Automata Theory · Computer Science 2011-12-13 Luke Schaeffer , Jeffrey Shallit

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.

Combinatorics · Mathematics 2009-04-14 James D. Currie , Narad Rampersad

The critical exponent of an infinite word $\bf x$ is the supremum, over all finite nonempty factors $f$, of the exponent of $f$. In this note we show that for all integers $k\geq 2,$ there is a binary infinite $k$-automatic sequence with…

Combinatorics · Mathematics 2026-02-25 J. -P. Allouche , N. Rampersad , J. Shallit

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

Discrete Mathematics · Computer Science 2015-06-12 Gabriele Fici , Filippo Mignosi

We study the set of $k$-abelian critical exponents of all Sturmian words. It has been proven that in the case $k = 1$ this set coincides with the Lagrange spectrum. Thus the sets obtained when $k > 1$ can be viewed as generalized Lagrange…

Discrete Mathematics · Computer Science 2020-04-09 Jarkko Peltomäki , Markus A. Whiteland

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…

Formal Languages and Automata Theory · Computer Science 2015-01-30 Emilie Charlier , Tero Harju , Svetlana Puzynina , Luca Zamboni

Let $G$ be a finite abelian group. The critical number ${\rm cr}(G)$ of $G$ is the least positive integer $\ell$ such that every subset $A\subseteq G\setminus\{0\}$ of cardinality at least $\ell$ spans $G$, i.e., every element of $G$ can be…

Combinatorics · Mathematics 2011-03-31 Dan Guo , Yongke Qu , Guoqing Wang , Qinghong Wang

In this paper, we study the critical exponent of infinite words $\ubeta$ coding $\beta$-integers for $\beta$ being a~non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the…

Combinatorics · Mathematics 2017-05-31 L. Balková , K. Klouda , E. Pelantová

An overlap-free (or $\beta$-free) word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ at any position contains an overlap (or a factor of exponent at least $\beta$,…

Combinatorics · Mathematics 2020-06-19 Lucas Mol , Narad Rampersad , Jeffrey Shallit

Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…

Combinatorics · Mathematics 2018-01-17 Narad Rampersad , Jeffrey Shallit , Élise Vandomme

Two finite words $u$ and $v$ are called abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of an infinite word $\mathbf{x}$ is the set of infinite words…

Combinatorics · Mathematics 2021-01-01 Juhani Karhumäki , Svetlana Puzynina , Markus A. Whiteland

We call a positive real number $\lambda$ admissible if it belongs to the Lagrange spectrum and there exists an irrational number $\alpha$ such that $\mu(\alpha)=\lambda$. Here $\mu(\alpha)$ denotes the Lagrange constant of $\alpha$ -…

Number Theory · Mathematics 2018-08-22 Dmitry Gayfulin

A finite word $w$ is an abelian square if $w = xx^\prime$ with $x^\prime$ a permutation of $x$. In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2 + 6k$ contains an abelian square of length $\geq 2k$. We…

Combinatorics · Mathematics 2010-12-03 Elyot Grant

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…

Group Theory · Mathematics 2013-01-18 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

We define and investigate the property of being `exponent-critical' for a finite group. A finite group is said to be exponent-critical if its exponent is not the least common multiple of the exponents of its proper non-abelian subgroups. We…

Group Theory · Mathematics 2024-04-22 Simon R. Blackburn , William Cocke , Andrew Misseldine , Geetha Venkataraman

We study the abelian period sets of Sturmian words, which are codings of irrational rotations on a one-dimensional torus. The main result states that the minimum abelian period of a factor of a Sturmian word of angle $\alpha$ with continued…

Formal Languages and Automata Theory · Computer Science 2020-07-27 Jarkko Peltomäki

Let G be an additive, finite abelian group. The critical number $\mathsf{cr}(G)$ of $G$ is the smallest positive integer $\ell$ such that for every subset $S \subset G \setminus \{0\}$ with $|S| \ge \ell$ the following holds: Every element…

Number Theory · Mathematics 2008-10-20 Michael Freeze , Weidong Gao , Alfred Geroldinger

Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$…

Combinatorics · Mathematics 2012-02-13 Stéphane Fischler
‹ Prev 1 2 3 10 Next ›