The undirected repetition threshold

04/22/2019
by   James D. Currie, et al.
0

For rational 1<r≤ 2, an undirected r-power is a word of the form xyx', where x≠ε, x'∈{x,x^R}, and |xyx'|/|xy|=r. The undirected repetition threshold for k letters, denoted URT(k), is the infimum of the set of all r such that undirected r-powers are avoidable on k letters. We first demonstrate that URT(3)=74. Then we show that URT(k)≥k-1k-2 for all k≥ 4. We conjecture that URT(k)=k-1k-2 for all k≥ 4, and we confirm this conjecture for k∈{4,8,12}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2020

The undirected repetition threshold and undirected pattern avoidance

For a rational number r such that 1<r≤ 2, an undirected r-power is a wor...
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
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
08/04/2021

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...
research
12/12/2019

Desynchronization in Oscillatory Networks Based on Yakubovich Oscillatority

The desynchronization problems in oscillatory networks is considered. A ...
research
07/25/2019

Learning binary undirected graph in low dimensional regime

Given a random sample extracted from a Multivariate Bernoulli Variable (...
research
05/20/2020

Edge removal in undirected networks

The edge-removal problem asks whether the removal of a λ-capacity edge f...

Please sign up or login with your details

Forgot password? Click here to reset