Avoiding 5/4-powers on the alphabet of nonnegative integers

DOI10.37236/9581MaRDI QIDQ2194095zbMATH OpenOpenAlexFDO

Authors Manon Stipulanti, Eric Rowland

Publication date 25 August 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Abstract: We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers. Specifically, we show that this word has the form $pau(varphi(z)varph{i}^2(z)cdots)$ where $p,z$ are finite words, $varphi$ is a 6-uniform morphism, and $au$ is a coding. This description yields a recurrence for the $i$th letter, which we use to prove that the sequence of letters is 6-regular with rank 188. More generally, we prove $k$-regularity for a sequence satisfying a recurrence of the same type.

Recommendations

• Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
• Avoidability of Additive Cubes over Alphabets of Four Numbers
• Avoiding conjugacy classes on the 5-letter alphabet
• scientific article; zbMATH DE number 5235871
• 5-abelian cubes are avoidable on binary alphabets
• Attaining the Exponent 5/4 for the Sum-Product Problem in Finite Fields
• On the Representations of a Number as the Sum of Four Fifth Powers
• On the Waring-Goldbach problem for fourth and fifth powers
• Almost fifth powers in arithmetic progression
• Avoiding abelian powers cyclically

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• A generalization of Cobham's theorem for regular sequences
• Automatic Sequences
• Avoiding 3/2-powers over the natural numbers
• Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
• Avoiding fractional powers over the natural numbers
• Avoiding squares and overlaps over the natural numbers
• Extremal infinite overlap-free binary words
• Sur un théorème de Thue
• The origins of combinatorics on words
• The ring of \(k\)-regular sequences

Cited in

(4)

• Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
• Revisiting regular sequences in light of rational base numeration systems
• The lexicographically least square-free word with a given prefix
• Avoiding fractional powers over the natural numbers

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Avoiding 5/4-powers on the alphabet of nonnegative integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194095)