Year: 2025
Type: preprint
Abstract: We prove that every $n$-letter word over $k$-letter alphabet contains some word as a subsequence in at least $k^{n/4k(1+o(1))}$ many ways, and that this is sharp as $k\to\infty$. For fixed $k$, we show that the analogous number deviates from $μ_k^n$, for some constant $μ_k$, by a factor of at most $n$.
Source: arXiv (Cornell University)
Authors: Bukh, Boris, Saatashvili, Aleksandre
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7083715141
Cites:
Cited by:
Related to: