Dyck words, lattice paths, and abelian borders
From MaRDI portal
Publication:5016359
zbMATH Open1485.68203arXiv1708.06461MaRDI QIDQ5016359FDOQ5016359
Authors: Kun Chen, Kenneth Hawes, F. Blanchet-Sadri 
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06461
Recommendations
Cites Work
- Binomial determinants, paths, and hook length formulae
- On the Vector Representations of Induced Matroids
- On abelian versions of critical factorization theorem
- Title not available (Why is that?)
- Dyck path enumeration
- Algorithms for jumbled pattern matching in strings
- Fast algorithms for abelian periods in words and greatest common divisor queries
- On approximate jumbled pattern matching in strings
- Scaled and permuted string matching
- A note on efficient computation of all abelian periods in a string
- Algorithms for computing abelian periods of words
- Narayana numbers and Schur-Szegő composition
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Oscillating rim hook tableaux and colored matchings
- Counting pairs of lattice paths by intersections
- Abelian borders in binary words
- On the number of abelian bordered words
Cited In (11)
- On highly palindromic words: the \(n\)-ary case
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Abelian borders in binary words
- The phagocyte lattice of Dyck words
- Dyck Words, Lattice Paths, and Abelian Borders
- On the number of abelian bordered words
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Dyck words, pattern avoidance, and automatic sequences
- On highly palindromic words: the ternary case
- On a theorem concerning partially overlapping subpalindromes of a binary word
- Enumeration of bordered words, le langage de la vache-qui-rit
This page was built for publication: Dyck words, lattice paths, and abelian borders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016359)
