English
Related papers

Related papers: Quasiperiodic Sturmian words and morphisms

200 papers

The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition.…

Group Theory · Mathematics 2007-05-23 Andrew Duncan , Robert H. Gilman

We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…

Formal Languages and Automata Theory · Computer Science 2017-08-30 Samuel J. v. Gool , Benjamin Steinberg

Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number of times in both words. The $k$-binomial complexity of an infinite word is a counting function that maps $n$ to the number of $k$-binomial…

Combinatorics · Mathematics 2022-12-07 Michel Rigo , Manon Stipulanti , Markus A. Whiteland

As an absolute invariant of smooth conjugacy, the multiplier group described the types of space-time symmetries that the flow has, and for a quasiperiodic flow on the $n$-torus, is the determining factor of the structure of its generalized…

Dynamical Systems · Mathematics 2007-05-23 L. F. Bakker

The set of finite words over a well-quasi-ordered set is itself well-quasi-ordered. This seminal result by Higman is a cornerstone of the theory of well-quasi-orderings and has found numerous applications in computer science. However, this…

Formal Languages and Automata Theory · Computer Science 2025-01-14 Nathan Lhote , Aliaume Lopez , Lia Schütze

Written with respect to an appropriate Poisson structure, a partially integrable Hamiltonian system is viewed as a completely integrable system with parameters. Then, the theorem on quasi-periodic stability in Ref. [1] (the KAM theorem) can…

Dynamical Systems · Mathematics 2007-05-23 G. Sardanashvily

We give a combinatorial definition of the second parameter describing Sturmian words, that we call formal intercept, as an infinite Ostrowski expansion. We recall the well-known properties of Sturmian words, study factors graphs and…

Combinatorics · Mathematics 2018-03-07 Caius Wojcik

Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…

Combinatorics · Mathematics 2022-05-12 Darby Bortz , Nicholas Cummings , Suyi Gao , Elias Jaffe , Lan Mai , Benjamin Steinhurst , Pauline Tillotson

Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…

Combinatorics · Mathematics 2021-07-06 Davi Castro-Silva

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

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…

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub

The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions about the link between dendricity and morphisms. In this paper,…

Discrete Mathematics · Computer Science 2023-04-06 France Gheeraert

In the article we give a self-contained new proof that a normal quasi-ordinary surface germ is analytically isomorphic to a cyclic quotient surface germ.

Algebraic Geometry · Mathematics 2024-10-29 Françoise Michel , Claude Weber

In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately…

Formal Languages and Automata Theory · Computer Science 2016-06-21 Michelangelo Bucci , Gwenaël Richomme

An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…

Combinatorics · Mathematics 2016-12-15 Sergey V. Avgustinovich , Anna E. Frid , Svetlana Puzynina

We define partial quasi-morphisms on the group of Hamiltonian diffeomorphisms of the cotangent bundle using the spectral invariants in Lagrangian Floer homology with conormal boundary conditions, where the product compatible with the PSS…

Symplectic Geometry · Mathematics 2021-04-13 Jelena Katić , Darko Milinković , Jovana Nikolić

Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…

Formal Languages and Automata Theory · Computer Science 2019-06-26 Jorge Almeida , Alfredo Costa , José Carlos Costa , Marc Zeitoun

Atomic-resolution electron microscope images show that a quasicrystal is a quasiperiodic packing of clusters. The outer atomic shells of multi-shell clusters occuring in quasicrystals are highly symmetric and rather robust, but some…

Mathematical Physics · Physics 2009-11-11 Nicolae Cotfas

We consider the problem of finding quasiperiodicities in a Fibonacci string. A factor u of a string y is a cover of y if every letter of y falls within some occurrence of u in y. A string v is a seed of y, if it is a cover of a superstring…

Combinatorics · Mathematics 2012-01-31 Michalis Christou , Maxime Crochemore , Costas Iliopoulos

We show that the local period at position n in a characteristic Sturmian word can be given in terms of the Ostrowski representation for n + 1.

Formal Languages and Automata Theory · Computer Science 2012-10-09 Luke Schaeffer
‹ Prev 1 3 4 5 6 7 10 Next ›