2-chains: An interesting family of posets

DOI10.1016/J.DISC.2020.111988MaRDI QIDQ776317zbMATH OpenOpenAlexFDO

Authors Matthew Fayers

Publication date 8 July 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.07574

zbMATH Keywords

2-chainCoxeter elementfinite poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

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.

Recommendations

• M-chain graphs of posets
• Partially ordered sets associated with permutations
• On maximal chains in the non-crossing partition lattice
• On the chain blockers
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics

Cites work

• 0-Hecke algebras of finite Coxeter groups.
• A Representation Theorem for Partial Orders
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• The enumeration of Coxeter elements
• The number of caterpillars
• Transitiv orientierbare Graphen

Cited in

(2)

• Families of chains of a poset and Sperner properties
• On the chain blockers

Describes a project that uses

Uses Software

• MathOverflow

This page was built for publication: 2-chains: An interesting family of posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776317)