Some Results on Digital Segments and Balanced Words

arXiv2211.09417MaRDI QIDQ6507088

Author name not available (Why is that?)

Abstract: We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We show that for every pair $(a,b)$ of positive integers, all the binary balanced words with $a$ zeroes and $b$ ones are good approximations of the Euclidean segment from $(0,0)$ to $(a,b)$, in the sense that they encode paths that are contained within the digital bar delimited by the lower and the upper Christoffel words of slope $b/a$. We then give a closed formula for counting the exact number of balanced words with $a$ zeroes and $b$ ones. We also study minimal non-balanced words and prefixes of Christoffel words.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Some Results on Digital Segments and Balanced Words

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