Finding binary words with a given number of subsequences
From MaRDI portal
Publication:6412587
DOI10.1016/J.TCS.2022.03.032arXiv2210.00342MaRDI QIDQ6412587
Author name not available (Why is that?)
Publication date: 1 October 2022
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.
No records found.
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 Q6412587)