Strings with maximally many distinct subsequences and substrings

zbMath1034.68067MaRDI QIDQ1422149

Gregory B. Sorkin, Aram W. Harrow, Abraham D. Flaxman

Publication date: 5 February 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/123417

zbMATH Keywords

extremal combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (8)

Finding binary words with a given number of subsequences ⋮ Algorithms for subsequence combinatorics ⋮ On extending de Bruijn sequences ⋮ Subsequence frequency in binary words ⋮ Diagonal Asymptotics for Products of Combinatorial Classes ⋮ On average sequence complexity ⋮ Test sequence construction using minimum information on the tested system ⋮ Maximal state complexity and generalized de Bruijn words

This page was built for publication: Strings with maximally many distinct subsequences and substrings