Dyck Words, Lattice Paths, and Abelian Borders
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of di...
Main Authors: | F. Blanchet-Sadri, Kun Chen, Kenneth Hawes |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2017-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1708.06461v1 |
Similar Items
-
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
by: Jean-Luc Baril, et al.
Published: (2021-04-01) -
Non-overlapping matrices via Dyck words
by: Elena Barcucci, et al.
Published: (2021-01-01) -
Non-abelian braiding in abelian lattice models from lattice dislocations
by: Flygare, Mattias
Published: (2014) -
The unmasking of Arnold Dyck : an exploration of the Dyck letters
by: Klassen, Cathrine Joyce Froese
Published: (2012) -
The unmasking of Arnold Dyck : an exploration of the Dyck letters
by: Klassen, Cathrine Joyce Froese
Published: (2012)