Nicolas Bédaride ; Eric Domenjoud ; Damien Jamet ; Jean-Luc Rémy - On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet

dmtcs:474 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 3 - https://doi.org/10.46298/dmtcs.474
On the Number of Balanced Words of Given Length and Height over a Two-Letter AlphabetArticle

Authors: Nicolas Bédaride 1; Eric Domenjoud 2; Damien Jamet 2; Jean-Luc Rémy 2

  • 1 Laboratoire d'Analyse, Topologie, Probabilités
  • 2 Applying Discrete Algorithms to Genomics and Imagery

We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give generating functions and study the asymptotic behaviour. As a particular case, we focus on the symmetrical discrete segments which are encoded by balanced palindromes.


Volume: Vol. 12 no. 3
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 344 times.
This article's PDF has been downloaded 273 times.