The phagocyte lattice of Dyck words

DOI10.1007/S11083-006-9034-0zbMATH Open1110.06003OpenAlexW4300072148MaRDI QIDQ862973FDOQ862973

Authors: Jean-Luc Baril, Jean Pallo 

Publication date: 25 January 2007

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-006-9034-0

Recommendations

• Dyck words, lattice paths, and abelian borders
• Dyck Words, Lattice Paths, and Abelian Borders
• Some permutations on Dyck words
• Lattices and multi-dimensional words
• Dyck Words, Pattern Avoidance, and Automatic Sequences
• On doubly symmetric Dyck words
• WORDS, DYCK PATHS, TREES, AND BIJECTIONS
• scientific article
• The Dyck pattern poset
• Structure of polyzetas and Lyndon words

zbMATH Keywords

efficient algorithmsnoncrossing partitions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• A Catalan triangle
• Chain enumeration and non-crossing partitions
• Non-crossing partitions for classical reflection groups
• Noncrossing partitions
• Metrics on partially ordered sets - a survey
• On the structure of the lattice of noncrossing partitions
• The number of coverings in four catalan lattices
• Two shortest path metrics on well-formed parentheses strings
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• A distance metric on binary trees using lattice-theoretic measures
• Title not available (Why is that?)
• An efficient upper bound of the rotation distance of binary trees
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• Lattices of lattice paths
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• The number of permutations containing exactly one increasing subsequence of length three
• Right-arm rotation distance between binary trees
• Title not available (Why is that?)
• Generating binary trees by Glivenko classes on Tamari lattices
• Chains in the lattice of noncrossing partitions
• An algorithm to compute the möbius function of the rotation lattice of binary trees

Cited In (3)

• The pruning-grafting lattice of binary trees
• Motzkin subposets and Motzkin geodesics in Tamari lattices.
• The combinator M and the Mockingbird lattice

Uses Software

• OEIS

This page was built for publication: The phagocyte lattice of Dyck words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862973)