Finding binary words with a given number of subsequences

DOI10.1016/J.TCS.2022.03.032MaRDI QIDQ2136284zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Subsequence frequency in binary words
• On the asymptotics of the number of binary words with a given length of a maximal series
• scientific article; zbMATH DE number 3910468
• On fragments of words
• On the sequence of the first binary digits of the fractional parts of the values of a polynomial

Cites work

• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• On Zaremba's conjecture
• 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

Cited in

(2)

• Subsequence frequency in binary words
• Finding binary words with a given number of subsequences

This page was built for publication: Finding binary words with a given number of subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136284)