Skip to Main content Skip to Navigation

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00580064
Contributor : Damien Jamet <>
Submitted on : Tuesday, March 29, 2011 - 10:55:13 AM
Last modification on : Wednesday, October 10, 2018 - 1:26:29 AM
Document(s) archivé(s) le : Thursday, November 8, 2012 - 12:51:04 PM

File

BeDoJaRe.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00580064, version 1

Collections

Citation

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. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.41-62. ⟨hal-00580064⟩

Share

Metrics

Record views

647

Files downloads

515