The undirected repetition threshold and undirected pattern avoidance

06/12/2020
by   James D. Currie, et al.
0

For a rational number r such that 1<r≤ 2, an undirected r-power is a word of the form xyx', where the word x is nonempty, the word x' is in {x,x^R}, and we have |xyx'|/|xy|=r. The undirected repetition threshold for k letters, denoted (k), is the infimum of the set of all r such that undirected r-powers are avoidable on k letters. We first demonstrate that (3)=74. Then we show that (k)≥k-1k-2 for all k≥ 4. We conjecture that (k)=k-1k-2 for all k≥ 4, and we confirm this conjecture for k∈{4,5,…,21}. We then consider related problems in pattern avoidance; in particular, we find the undirected avoidability index of every binary pattern. This is an extended version of a paper presented at WORDS 2019, and it contains new and improved results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2019

The undirected repetition threshold

For rational 1<r≤ 2, an undirected r-power is a word of the form xyx', w...
research
09/05/2018

Repetition avoidance in products of factors

We consider a variation on a classical avoidance problem from combinator...
research
01/16/2018

Subword complexity and power avoidance

We begin a systematic study of the relations between subword complexity ...
research
05/21/2020

Undirected Unicast Network Capacity: A Partition Bound

In this paper, we present a new technique to obtain upper bounds on undi...
research
11/13/2019

The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27

For every n≥ 27, we show that the number of n/(n-1)^+-free words (i.e., ...
research
05/21/2020

On the Partition Bound for Undirected Unicast Network Information Capacity

One of the important unsolved problems in information theory is the conj...
research
07/13/2022

Monotonicity in Undirected Networks

Is it always beneficial to create a new relationship (have a new followe...

Please sign up or login with your details

Forgot password? Click here to reset