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

page 1

page 2

page 3

page 4

research
10/02/2022

The lexicographically least square-free word with a given prefix

The lexicographically least square-free infinite word on the alphabet of...
research
07/29/2021

Mesosome Avoidance

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

New results on pseudosquare avoidance

We start by considering binary words containing the minimum possible num...
research
10/02/2020

Hidden automatic sequences

An automatic sequence is a letter-to-letter coding of a fixed point of a...
research
08/14/2023

Asymptotic nonnegative rank of matrices

The nonnegative rank of nonnegative matrices is an important quantity th...
research
02/08/2023

Convolutional Neural Networks Trained to Identify Words Provide a Good Account of Visual Form Priming Effects

A wide variety of orthographic coding schemes and models of visual word ...
research
10/06/2020

Improving Nonparametric Density Estimation with Tensor Decompositions

While nonparametric density estimators often perform well on low dimensi...

Please sign up or login with your details

Forgot password? Click here to reset