On maximal chains in the non-crossing partition lattice

DOI10.1016/J.JCTA.2014.02.002MaRDI QIDQ2451893zbMATH OpenOpenAlexFDO

Authors Ron Adin, Yuval Roichman

Publication date 26 May 2014

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

0-Hecke algebraCatalan numberCoxeter groupHurwitz actionradiusreduced wordsymmetric groupweak order

Mathematics Subject Classification ID

Hecke algebras and their representations (20C08) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element.

Recommendations

• Chains in the lattice of noncrossing partitions
• Noncrossing partitions and the shard intersection order
• Chains in the Noncrossing Partition Lattice
• On the structure of the lattice of noncrossing partitions
• Parallelizing pairings on Hessian elliptic curves

Cites work

• A note on log-convexity of \(q\)-Catalan numbers
• Combinatorics of Coxeter Groups
• Deformations of permutation representations of Coxeter groups.
• Diameter of graphs of reduced words and galleries.
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Geometric tree graphs of points in convex position
• scientific article; zbMATH DE number 988665 (Why is no real title available?)
• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Mahonian pairs
• Minimal transitive products of transpositions---the reconstruction of a proof of A. Hurwitz
• On the distance between the expressions of a permutation
• q-Catalan numbers
• Some factorisations counted by Catalan numbers
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The absolute order of a permutation representation of a Coxeter group
• THE BRAID GROUP AND OTHER GROUPS
• The dual braid monoid
• Tree-like properties of cycle factorizations
• Two element lattice permutation numbers and their \(q\)-generalization

Cited in

(9)

• Chains in the lattice of noncrossing partitions
• An area-depth symmetric \(q, t\)-Catalan polynomial
• Catalan intervals and uniquely sorted permutations
• Trees, parking functions and factorizations of full cycles
• A poset structure on the alternating group generated by 3-cycles
• On bordered theories for Khovanov homology
• Motzkin and Catalan tunnel polynomials
• Centrality of star and monotone factorisations
• 2-chains: An interesting family of posets

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On maximal chains in the non-crossing partition lattice

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