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

05/06/2020
by   Eric Rowland, et al.
0

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 p τ(φ(z) φ^2(z) ⋯) where p, z are finite words, φ is a 6-uniform morphism, and τ is a coding. This description yields a recurrence for the ith 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/29/2021

Mesosome Avoidance

We consider avoiding mesosomes – that is, words of the form xx' with x' ...
04/19/2019

New results on pseudosquare avoidance

We start by considering binary words containing the minimum possible num...
09/07/2020

On prefix palindromic length of automatic words

The prefix palindromic length PPL_𝐮(n) of an infinite word 𝐮 is the mini...
10/02/2020

Hidden automatic sequences

An automatic sequence is a letter-to-letter coding of a fixed point of a...
04/21/2020

On the regularity of De Bruijn multigrids

In this paper we prove that any odd multigrid with non-zero rational off...
10/29/2019

A sufficient condition for local nonnegativity

A real polynomial f is called local nonnegative at a point p, if it is n...
01/18/2021

Computability of Data-Word Transductions over Different Data Domains

In this paper, we investigate the problem of synthesizing computable fun...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.