English
Related papers

Related papers: Rational Noncrossing Coxeter-Catalan Combinatorics

200 papers

Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation,…

Representation Theory · Mathematics 2008-11-20 Florent Hivert , Nicolas M. Thiéry

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

Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…

Mathematical Physics · Physics 2022-04-15 Jins de Jong , Alexander Hock , Raimar Wulkenhaar

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

Combinatorics · Mathematics 2024-09-17 Stella Cohen , Michael Dougherty , Andrew D. Harsh , Spencer Park Martin

The goal of this paper is to introduce and study noncommutative Catalan numbers $C_n$ which belong to the free Laurent polynomial algebra in $n$ generators. Our noncommutative numbers admit interesting (commutative and noncommutative)…

Quantum Algebra · Mathematics 2019-10-09 Arkady Berenstein , Vladimir Retakh

For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…

Combinatorics · Mathematics 2023-12-13 Yen-Jen Cheng , Sen-Peng Eu , Tung-Shan Fu , Jyun-Cheng Yao

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…

Representation Theory · Mathematics 2007-05-23 Ron M. Adin , Francesco Brenti , Yuval Roichman

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

When W is a finite reflection group, the noncrossing partition lattice NCP_W of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case)…

Combinatorics · Mathematics 2014-06-10 Vivien Ripoll

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 present the new combinatorial class of product-coproduct prographs which are planar assemblies of two types of operators: products having two inputs and a single output and coproducts having a single input and two outputs. We show that…

Combinatorics · Mathematics 2017-04-04 Nicolas Borie

Hecke algebras are beautiful q-extensions of Coxeter groups. In this paper, we prove several results on their characters, with an emphasis on characters induced from trivial and sign representations of parabolic subalgebras. While most of…

Combinatorics · Mathematics 2008-12-09 Matjaz Konvalinka

For each pair of coprime integers $a$ and $b$ we have a rational $q$-Catalan number $\operatorname{Cat}(a,b)_q=\binom{a+b}{a}_q/[a+b]_q$. It is known that this is a polynomial in $q$ with nonnegative integer coefficients, but the nature of…

Combinatorics · Mathematics 2026-04-20 Drew Armstrong

We study polynomial summation over unit circles over finite fields of odd characteristic, obtaining a purely algebraic integration theory without recourse to infinite procedures. There are nonetheless strong parallels to classical…

Combinatorics · Mathematics 2022-08-04 Kevin Limanta , Norman J. Wildberger

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

Combinatorics · Mathematics 2008-10-09 Guoce Xin , Terence Y. J. Zhang

Non-crossing partitions have been a staple in combinatorics for quite some time. More recently, they have surfaced (sometimes unexpectedly) in various other contexts from free probability to classifying spaces of braid groups. Also,…

Group Theory · Mathematics 2019-03-05 Barbara Baumeister , Kai-Uwe Bux , Friedrich Götze , Dawid Kielak , Henning Krause

In combinatorics there is a well-known duality between non-nesting and non-crossing objects. In algebra there are many objects which are standard, for example Standard Young Tableaux, Standard Monomials, Standard Bitableaux. We adopt a…

Combinatorics · Mathematics 2007-05-23 Pavlo Pylyavskyy

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

Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…

Group Theory · Mathematics 2025-10-10 Davide Dal Martello

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

Representation Theory · Mathematics 2025-07-21 Nate Harman , Alexander N. Wilson