English
Related papers

Related papers: Noncrossing partitions, clusters and the Coxeter p…

200 papers

In this article we prove that the lattice of noncrossing partitions is EL-shellable when associated with the well-generated complex reflection group of type $G(d,d,n)$, for $d,n\geq 3$, or with the exceptional well-generated complex…

Combinatorics · Mathematics 2016-07-27 Henri Mühle

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

A regular $A_n$-crystal is an edge-colored directed graph, with $n$ colors, related to an irreducible highest weight integrable module over $U_q(sl_{n+1})$. Based on Stembridge's local axioms for regular simply-laced crystals and a…

Representation Theory · Mathematics 2010-11-15 V. I. Danilov , A. V. Karzanov , G. A. Koshevoy

We construct finite volume hyperbolic manifolds with large symmetry groups. The construction makes use of the presentations of finite Coxeter groups provided by Barot and Marsh and involves mutations of quivers and diagrams defined in the…

Geometric Topology · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

Group Theory · Mathematics 2014-04-01 Timothée Marquis

We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model…

Quantum Physics · Physics 2010-10-28 J. Geraci , D. A. Lidar

We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…

Combinatorics · Mathematics 2012-02-29 Christian Krattenthaler , Thomas W. Müller

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

Operator Algebras · Mathematics 2009-01-26 Mihai Popa

The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…

Representation Theory · Mathematics 2014-06-16 Mikhail V. Belolipetsky , Paul E. Gunnells

We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…

Representation Theory · Mathematics 2025-03-26 Thomas Creutzig , Justine Fasquel , Andrew R. Linshaw , Shigenori Nakatsuka

For any finite reductive group, we compute the central elements in its Hecke algebra that arise from partial Springer resolutions via the Harish-Chandra transform. Of the two kinds of partial resolution, the larger is the more interesting…

Representation Theory · Mathematics 2026-01-27 Minh-Tâm Quang Trinh , Nathan Williams

An odd Coxeter group $W$ is one which admits a Coxeter system $(W,S)$ for which all the exponents $m_{ij}$ are either odd or infinity. The paper investigates the family of odd Coxeter groups whose associated labeled graphs…

Group Theory · Mathematics 2021-07-19 Tushar Kanta Naik , Mahender Singh

We study the Hecke algebra $\H(\bq)$ over an arbitrary field $\FF$ of a Coxeter system $(W,S)$ with independent parameters $\bq=(q_s\in\FF:s\in S)$ for all generators. This algebra is always linearly spanned by elements indexed by the…

Representation Theory · Mathematics 2014-12-04 Jia Huang

Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for…

Combinatorics · Mathematics 2025-04-22 Emily Barnard , Nathan Reading , Ashley M. Tharp

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

Combinatorics · Mathematics 2007-05-23 Peter Mani-Levitska , Sinisa Vrecica , Rade Zivaljevic

Let (W,S) be an infinite Coxeter system. To each geometric representation of W is associated a root system. While a root system lives in the positive side of the isotropy cone of its associated bilinear form, an imaginary cone lives in the…

Group Theory · Mathematics 2016-02-03 Matthew Dyer , Christophe Hohlweg , Vivien Ripoll

The aim of this paper is to construct exact model structures from so called extendable cotorsion pairs. Given a hereditary Hovey triple $(\mathcal{C}, \mathcal{W}, \mathcal{F})$ in a weakly idempotent complete exact category with enough…

Category Theory · Mathematics 2026-02-03 Qingyu Shao , Junpeng Wang , Xiaoxiang Zhang

We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.

Combinatorics · Mathematics 2009-10-02 Alex Fink , Benjamin Iriarte Giraldo

For an arbitrary finite Coxeter group W we define the family of Cambrian lattices for W as quotients of the weak order on W with respect to certain lattice congruences. We associate to each Cambrian lattice a complete fan, which we…

Combinatorics · Mathematics 2026-05-13 Nathan Reading