Mathematics – Combinatorics
Scientific paper
2010-07-29
published in Discrete Mathematics & Theoretical Computer Science in 2010
Mathematics
Combinatorics
24 pages
Scientific paper
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.
Bedaride Nicolas
Domenjoud Eric
Jamet Damien
Remy Jean-Luc
No associations
LandOfFree
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-451360