2-chains: an interesting family of posets
Combinatorics
2020-01-30 v2
Abstract
We introduce a new family of finite posets which we call 2-chains. These first arose in the study of 0-Hecke algebras, but they admit a variety of different characterisations. We give these characterisations, prove that they are equivalent and derive some numerical results concerning 2-chains.
Cite
@article{arxiv.1809.07574,
title = {2-chains: an interesting family of posets},
author = {Matthew Fayers},
journal= {arXiv preprint arXiv:1809.07574},
year = {2020}
}