Combinatorics arising from lax colimits of posets
From MaRDI portal
Publication:6139857
Abstract: In this paper we study maximal chains in certain lattices constructed from powers of chains by iterated lax colimits in the -category of posets. Such a study is motivated by the fact that in lower dimensions, we get some familiar combinatorial objects such as Dyck paths and Kreweras walks.
Recommendations
- ON COLIMITS OVER ARBITRARY POSETS
- Combinatorics of positroids
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- scientific article; zbMATH DE number 3995740
- Combinatorics and total positivity
- Lagrangian combinatorics of matroids
- scientific article; zbMATH DE number 1159818
- Lazard's Theorem for S ‐posets
- Posets of \({\mathcal C}\)-congruences
- Varieties corresponding to classes of complemented posets
Cites Work
- scientific article; zbMATH DE number 2172008 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
- Bijective counting of Kreweras walks and loopless triangulations
- Biproducts and commutators for Noetherian forms
- Duality in non-abelian algebra. IV. Duality for groups and a universal isomorphism theorem
- Homological algebra. The interplay of homology with distributive lattices and orthodox semigroups.
- On the asymptotic growth of the number of tree-child networks
- Walks in the quarter plane: Kreweras' algebraic model
Cited In (4)
This page was built for publication: Combinatorics arising from lax colimits of posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139857)