English
Related papers

Related papers: Generalized non-crossing Partitions and Buildings

200 papers

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…

Combinatorics · Mathematics 2013-12-25 Ron M. Adin , Yuval Roichman

We define noncrossing partitions of a marked surface without punctures (interior marked points). We show that the natural partial order on noncrossing partitions is a graded lattice and describe its rank function topologically. Lower…

Combinatorics · Mathematics 2026-05-22 Nathan Reading

The usual, or type A_n, Tamari lattice is a partial order on T_n^A, the triangulations of an (n+3)-gon. We define a partial order on T_n^B, the set of centrally symmetric triangulations of a (2n+2)-gon. We show that it is a lattice, and…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

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 introduce a new class of reflection groups associated with the canonical bilinear lattices of Lenzing, which we call reflection groups of canonical type. The main result of this work is a categorification of the corresponding poset of…

Representation Theory · Mathematics 2025-12-02 Barbara Baumeister , Igor Burban , Georges Neaime , Charly Schwabe

We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection…

Combinatorics · Mathematics 2007-05-23 David Callan , Len Smiley

We introduce bijections between generalized type $A_n$ noncrossing partitions (that is, associated to arbitrary standard Coxeter elements) and fully commutative elements of the same type. The latter index the diagram basis of the classical…

Combinatorics · Mathematics 2016-08-17 Thomas Gobet

We extend the theory of dual Coxeter and Artin groups to all rank-three Coxeter systems, beyond the previously studied spherical and affine cases. Using geometric, combinatorial, and topological techniques, we show that rank-three…

Group Theory · Mathematics 2025-01-15 Emanuele Delucchi , Giovanni Paolini , Mario Salvetti

We classify t-structures and thick subcategories in discrete cluster categories $\mathcal{C}(\mathcal{Z})$ of Dynkin type $A$, and show that the set of all t-structures on $\mathcal{C}(\mathcal{Z})$ is a lattice under inclusion of aisles,…

Representation Theory · Mathematics 2022-12-29 Sira Gratz , Alexandra Zvonareva

For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…

Combinatorics · Mathematics 2021-07-26 Henri Mühle , Philippe Nadeau , Nathan Williams

Let $\Sigma$ be the Davis complex for a Coxeter system (W,S). The automorphism group G of $\Sigma$ is naturally a locally compact group, and a simple combinatorial condition due to Haglund--Paulin determines when G is nondiscrete. The…

Group Theory · Mathematics 2011-03-22 Anne Thomas

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We prove that certain families of Coxeter groups and inclusions $W_1\hookrightarrow W_2\hookrightarrow...$ satisfy homological stability, meaning that in each degree the homology $H_\ast(BW_n)$ is eventually independent of $n$. This gives a…

Algebraic Topology · Mathematics 2016-11-16 Richard Hepworth

We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\geq 2$ admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

Combinatorics · Mathematics 2014-07-09 N. Amend , T. Hoge , G. Roehrle

A group theoretical discussion on the hypercubic lattice described by the affine Coxeter-Weyl group Wa(Bn) has been presented. When the lattice is projected onto the Coxeter plane it is noted that the maximal dihedral subgroup Dh of W(Bn)…

Mathematical Physics · Physics 2016-12-20 Mehmet Koca , Nazife Ozdes Koca , Ramazan Koc

Let S_n denote the symmetric group on n letters. We consider the S_n-root lattice A_{n-1} = {(z1,...,zn) in Z^n | z1+...+zn = 0}, where S_n acts on Z^n by permuting the coordinates, and its tensor, symmetric, and exterior squares. For odd…

Rings and Algebras · Mathematics 2007-05-23 Nicole Lemire , Martin Lorenz

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Combinatorics · Mathematics 2025-02-11 Grant T. Barkley