Finding binary words with a given number of subsequences

DOI10.1016/j.tcs.2022.03.032OpenAlexW4220707627MaRDI QIDQ2136284

Radosław Żak

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

continued fractionscombinatorics of wordssubsequences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Strings with maximally many distinct subsequences and substrings
• The law of large numbers for the sum of the partial quotients of a rational number with fixed denominator
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• On Zaremba's conjecture