English
Related papers

Related papers: Cataland: Why the Fuss?

200 papers

We examine the poset $P$ of 132-avoiding $n$-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset $Q$ of noncrossing partitions . In other words, if $x<y$ in $Q$, then $f(y)<f(x)$ in $P$,…

Combinatorics · Mathematics 2007-05-23 Miklos Bona

We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky to a finite root system and (b) the lattice of noncrossing partitions associated to the…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…

Combinatorics · Mathematics 2007-05-23 David Callan

The irreducible euclidean Coxeter groups that naturally act geometrically on euclidean space are classified by the well-known extended Dynkin diagrams and these diagrams also encode the modified presentations that define the irreducible…

Group Theory · Mathematics 2014-11-14 Jon McCammond

The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on…

Combinatorics · Mathematics 2014-06-09 Jean-Christophe Novelli

We present an exposition on the Fuss--Catalan numbers, which are a generalization of the well known Catalan numbers. The literature on the subject is scattered (especially for the case of multiple independent parameters, as will be…

Combinatorics · Mathematics 2024-12-17 S. R. Mane

We show that the Coxeter-sortable elements in a finite Coxeter group W are the minimal congruence-class representatives of a lattice congruence of the weak order on W. We identify this congruence as the Cambrian congruence on W, so that the…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…

Representation Theory · Mathematics 2026-04-28 Liping Li

We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…

Combinatorics · Mathematics 2026-05-28 Nathan Reading , David E Speyer

Motivated by the definition of Freiman homomorphism, we explore the possibilities of formulating some basic notions and techniques of additive combinatorics in a categorical language. We show that additive sets and Freiman homomorphisms…

Combinatorics · Mathematics 2025-02-14 Saúl A. Blanco , Esfandiar Haghverdi

We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…

Rings and Algebras · Mathematics 2008-05-19 Shih-Wei Yang , Andrei Zelevinsky

For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…

Combinatorics · Mathematics 2013-10-08 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…

Group Theory · Mathematics 2022-02-07 Barbara Baumeister , Georges Neaime , Sarah Rees

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

Combinatorics · Mathematics 2018-01-09 Matthieu Josuat-Vergès

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

Combinatorics · Mathematics 2008-04-01 Martin Klazar

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 introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…

Representation Theory · Mathematics 2012-01-31 Ibrahim Assem , Grégoire Dupont , Ralf Schiffler

We define for every affine Coxeter graph a certain factor group of the associated Artin group and prove that some of these groups appear as orbifold fundamental groups of moduli spaces. Examples are the moduli space of nonsingular cubic…

Algebraic Geometry · Mathematics 2007-06-13 Eduard Looijenga

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Combinatorics · Mathematics 2011-02-07 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

We construct (q,t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W. The two main ingredients in this construction are Rouquier's formulation of shift functors for the rational Cherednik…

Combinatorics · Mathematics 2009-12-09 Iain Gordon , Stephen Griffeth