Sequence saturation

In this paper, we introduce saturation and semisaturation functions of sequences, and we prove a number of fundamental results about these functions. Given a forbidden sequence $u$ with $r$ distinct letters, we say that a sequence $s$ on a given alphabet is $u$-saturated if $s$ is $r$-sparse, $u$-free, and adding any letter from the alphabet to an arbitrary position in $s$ violates $r$-sparsity or induces a copy of $u$. We say that $s$ is $u$-semisaturated if $s$ is $r$-sparse and adding any letter from the alphabet to $s$ violates $r$-sparsity or induces a new copy of $u$. Let the saturation function $Sat(u,n)$ denote the minimum possible length of a $u$-saturated sequence on an alphabet of size $n$, and let the semisaturation function $Ssat(u,n)$ denote the minimum possible length of a $u$-semisaturated sequence on an alphabet of size $n$. For alternating sequences, we determine both the saturation function and the semisaturation function up to a constant multiplicative factor. We show for every sequence that the semisaturation function is always either $O\left(1\right)$ or $\Theta \left(n\right)$. For the saturation function, we show that every sequence $u$ has either $Sat(u,n)\ge n$ or $Sat(u,n)=O\left(1\right)$. For every sequence with 2 distinct letters, we show that the saturation function is always either $O\left(1\right)$ or $\Theta \left(n\right)$.