Expected Number of Distinct Subsequences in Randomly Generated Binary Strings

zbMath1401.05298arXiv1704.08661MaRDI QIDQ4560193

Anant P. Godbole, Elizabeth Kelley, Yonah Biers-Ariel

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1704.08661

zbMATH Keywords

subadditivityrandom stringsdistinct subsequences

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Finding binary words with a given number of subsequences ⋮ Universal arrays

This page was built for publication: Expected Number of Distinct Subsequences in Randomly Generated Binary Strings