# Quasi-Regular Sequences

29 Sep 2019 Frisch Joshua Hann-Caruthers Wade Ferdowsi Pooya Vahidi

Let $\Sigma$ be a countable alphabet. For $r\geq 1$, an infinite sequence $s$ with characters from $\Sigma$ is called $r$-quasi-regular, if for each $\sigma\in\Sigma$ the ratio of the longest to shortest interval between consecutive occurrences of $\sigma$ in $s$ is bounded by $r$... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now

# Categories

• COMBINATORICS