English
Related papers

Related papers: M\"obius numbers of some modified generalized nonc…

200 papers

This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset $NC^{(k)}(W)$ for each finite…

Combinatorics · Mathematics 2007-10-19 Drew Armstrong

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

The $M$-triangle of a ranked locally finite poset $P$ is the generating function $\sum_{u,w\in P} ^{}\mu(u,w) x^{\rk u}y^{\rk w}$, where $\mu(.,.)$ is the M\"obius function of $P$. We compute the $M$-triangle of Armstrong's poset of…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Combinatorics · Mathematics 2010-01-18 Christian Krattenthaler , Thomas Müller

The noncrossing partition poset associated to a Coxeter group $W$ and Coxeter element $c$ is the interval $[1,c]_T$ in the absolute order on $W$. We construct a new model of noncrossing partititions for $W$ of classical affine type, using…

Combinatorics · Mathematics 2026-05-13 Laura G. Brestensky , Nathan Reading

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

We pose counting problems related to the various settings for Coxeter-Catalan combinatorics (noncrossing, nonnesting, clusters, Cambrian). Each problem is to count "twin" pairs of objects from a corresponding problem in Coxeter-Catalan…

Combinatorics · Mathematics 2026-05-13 Emily Barnard , Nathan Reading

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

Let W be a finite crystallographic reflection group. The generalized Catalan number of W coincides both with the number of clusters in the cluster algebra associated to W, and with the number of noncrossing partitions for W. Natural…

Representation Theory · Mathematics 2011-06-15 Aslak Bakke Buan , Idun Reiten , Hugh Thomas

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

Combinatorics · Mathematics 2019-09-17 Zhicong Lin , Dongsu Kim

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated…

Combinatorics · Mathematics 2013-10-07 Christian Krattenthaler , Thomas W. Müller

For W a finite Coxeter group, a formula is found for the size of W equivalence classes of subsets of a base. The proof is a case-by-case analysis using results and tables of Carter and Orlik/Solomon. As a corollary we obtain an alternating…

Group Theory · Mathematics 2007-05-23 Jason Fulman

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

Combinatorics · Mathematics 2018-05-24 Julia Heller , Petra Schwer

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

Combinatorics · Mathematics 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

Combinatorics · Mathematics 2025-08-26 Kurusch Ebrahimi-Fard , Loïc Foissy , Joachim Kock , Frédéric Patras

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

Group Theory · Mathematics 2023-08-01 Thomas Gobet

In [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…

Representation Theory · Mathematics 2017-10-10 Debarun Ghosh , Steven Spallone

This note discusses the bijection between the exceptional subcategories of representations of quivers and generalized non-crossing partitions of Weyl groups. We give a new proof of the Ingalls-Thomas-Igusa-Schiffler bijection by using the…

Representation Theory · Mathematics 2016-01-29 Anningzhe Gao

Let $\Phi$ be an finite root system with corresponding reflection group $W$ and let $m$ be a nonnegative integer. We consider the generalized cluster complex $\Delta^m(\Phi)$ defined by S. Fomin and N. Reading and the poset $NC_{(m)}(W)$ of…

Combinatorics · Mathematics 2007-05-23 E. Tzanaki
‹ Prev 1 2 3 10 Next ›