Combinatorics arising from lax colimits of posets

Combinatorics arising from lax colimits of posets

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-10
Hauptverfasser: Janelidze, Zurab, Prodinger, Helmut, Francois van Niekerk
Format: Artikel
Sprache:eng
Schlagworte:
Chains
Combinatorial analysis
Lattices
Set theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422