Restricting Dyck paths and 312-avoiding permutations
From MaRDI portal
Recommendations
Cites work
- A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
- A strong non-overlapping Dyck code
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- Avoiding cross-bifix-free binary words
- Culminating paths
- Dyck path enumeration
- ECO:a methodology for the enumeration of combinatorial objects
- Enumerative combinatorics of intervals in the Dyck pattern poset
- Gray code orders for \(q\)-ary words avoiding a given factor
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Patterns in Shi tableaux and Dyck paths
- Production matrices
- Recurrence relations, succession rules and the positivity problem
- Strings from linear recurrences: a Gray code
- The number of Baxter permutations
- Variable-Length Non-Overlapping Codes
Cited in
(1)
This page was built for publication: Restricting Dyck paths and 312-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076148)