Finding binary words with a given number of subsequences
Combinatorics
2022-10-04 v1
Abstract
We relate binary words with a given number of subsequences to continued fractions of rational numbers with a given denominator. We deduce that there are binary strings of length with exactly subsequences; this can be improved to under assumption of Zaremba's conjecture.
Keywords
Cite
@article{arxiv.2210.00342,
title = {Finding binary words with a given number of subsequences},
author = {Radosław Żak},
journal= {arXiv preprint arXiv:2210.00342},
year = {2022}
}