Updown categories: generating functions and universal covers
From MaRDI portal
Publication:898157
Abstract: A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for more than one morphism between objects, we have a sort of generalized poset in which there are multiplicities attached to covering relations, and possibly nontrivial automorphism groups. We call such a category an "updown category". In this paper we give a precise definition of such categories and develop a theory for them. We also give a detailed account of ten examples, including updown categories of integer partitions, integer compositions, planar rooted trees, and rooted trees.
Recommendations
Cites work
- scientific article; zbMATH DE number 1686998 (Why is no real title available?)
- scientific article; zbMATH DE number 4160796 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 848097 (Why is no real title available?)
- An analogue of covering space theory for ranked posets
- Cayley permutations
- Combinatorics of rooted trees and Hopf algebras
- Differential Posets
- Down-up algebras
- Duality of graded graphs
- Random partitions in population genetics
- Renormalization automated by Hopf algebra
- The On-Line Encyclopedia of Integer Sequences
Cited in
(3)
This page was built for publication: Updown categories: generating functions and universal covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898157)