Abelian complexity of minimal subshifts

From MaRDI portal
Publication:3074533

DOI10.1112/jlms/jdq063zbMath1211.68300arXiv0911.2914OpenAlexW3105514554MaRDI QIDQ3074533

Gwenaël Richomme, Luca Q. Zamboni, Kalle Saari

Publication date: 9 February 2011

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.2914




Related Items (55)

Abelian powers and repetitions in Sturmian wordsWeighted prefix normal words: mind the gapComputing abelian complexity of binary uniform morphic wordsThe Frobenius problem for homomorphic embeddings of languages into the integersAbelian Repetitions in Sturmian WordsOn abelian versions of critical factorization theoremAvoiding Three Consecutive Blocks of the Same Size and Same SumCyclic Complexity of WordsThe abelian complexity of infinite words and the Frobenius problemAbelian Complexity and SynchronizationCototal enumeration degrees and their applications to effective mathematicsLie complexity of wordsOn the asymptotic abelian complexity of morphic wordsOn the abelian complexity of the Rudin-Shapiro sequenceOn a generalization of abelian equivalence and complexity of infinite wordsProperties of a ternary infinite wordAbelian periods of factors of Sturmian wordsOn the abelian complexity of generalized Thue-Morse sequencesOn the \(k\)-abelian complexity of the Cantor sequenceThe history of the Gothenburg--Reykjavík--Strathclyde combinatorics groupAbelian combinatorics on words: a surveyOpen and closed factors in Arnoux-Rauzy wordsMinimal Complexities for Infinite Words Written with d LettersOn a Class of 2-Balanced SequencesOn the 2-binomial complexity of the generalized Thue-Morse wordsCharacterizations of families of morphisms and words via binomial complexitiesA note on abelian returns in rotation wordsAbelian complexity of infinite words associated with quadratic Parry numbersAbelian properties of Parry wordsSturmian jungle (or garden?) on multiliteral alphabetsOn $k$-abelian equivalence and generalized Lagrange spectraAnother generalization of abelian equivalence: binomial complexity of infinite wordsOn the boundary sequence of an automatic sequenceAbelian bordered factors and periodicityOn the additive complexity of a Thue-Morse-like sequenceAbelian closures of infinite binary wordsWeak abelian periodicity of infinite wordsRelations on wordsCyclic complexity of wordsSeparating the Words of a Language by Counting FactorsA square root map on Sturmian wordsOn \(k\)-abelian palindromesAbelian antipowers in infinite wordsRecurrent words with constant abelian complexityAbelian maximal pattern complexity of wordsUnnamed ItemBalances and Abelian Complexity of a Certain Class of Infinite Ternary WordsComputing the \(k\)-binomial complexity of the Thue-Morse wordOn infinite prefix normal wordsEulerian entropy and non-repetitive subword complexityAbelian Complexity and Frequencies of Letters in Infinite WordsAperiodic two-dimensional words of small abelian complexityOn the 2-abelian complexity of generalized Cantor sequencesOn balanced and abelian properties of circular words over a ternary alphabetOn a group theoretic generalization of the Morse-Hedlund theorem




This page was built for publication: Abelian complexity of minimal subshifts