DeepAI AI Chat
Log In Sign Up

The undirected repetition threshold

by   James D. Currie, et al.
The University of Winnipeg

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}.


page 1

page 2

page 3

page 4


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...

Undirected Unicast Network Capacity: A Partition Bound

In this paper, we present a new technique to obtain upper bounds on undi...

On the Partition Bound for Undirected Unicast Network Information Capacity

One of the important unsolved problems in information theory is the conj...

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...

A Parallel PageRank Algorithm For Undirected Graph

PageRank is a fundamental property of graph and there have been plenty o...

Desynchronization in Oscillatory Networks Based on Yakubovich Oscillatority

The desynchronization problems in oscillatory networks is considered. A ...

Learning binary undirected graph in low dimensional regime

Given a random sample extracted from a Multivariate Bernoulli Variable (...