Combinatorics arising from lax colimits of posets
Abstract
In this paper we study maximal chains in certain lattices constructed from powers of chains by iterated lax colimits in the 2-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.