中文
相关论文

相关论文: Noncrossing partitions under rotation and reflecti…

200 篇论文

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…

组合数学 · 数学 2007-05-23 William Y. C. Chen , Sherry H. F. Yan

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

组合数学 · 数学 2023-10-24 Juan B. Gil , Jordan O. Tirrell

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…

组合数学 · 数学 2013-10-07 Christian Krattenthaler , Thomas W. Müller

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

概率论 · 数学 2017-06-30 Igor Kortchemski , Cyril Marzouk

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type $D_n$ and those of exceptional type and rank…

组合数学 · 数学 2007-05-23 Christos A. Athanasiadis , Thomas Brady , Colum Watt

We study the structure of two cointeracting bialgebras on noncrossing partitions appearing in the theory of free probability. The first coproduct is given by separation of the blocks of the partitions into two parts, with respect to the…

组合数学 · 数学 2025-04-09 Loïc Foissy

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…

组合数学 · 数学 2011-08-30 Jang Soo Kim

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…

组合数学 · 数学 2025-08-26 Kurusch Ebrahimi-Fard , Loïc Foissy , Joachim Kock , Frédéric Patras

Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generated complex reflection group, the noncrossing partition lattice NCP_W of type W is a very rich combinatorial object, extending the notion of…

群论 · 数学 2010-10-22 Vivien Ripoll

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

组合数学 · 数学 2007-05-23 Rekha Natarajan

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…

组合数学 · 数学 2008-10-09 Guoce Xin , Terence Y. J. Zhang

For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…

For coprime positive integers $a<b$, Armstrong, Rhoades, and Williams (2013) defined a set $NC(a,b)$ of rational noncrossing partitions, a subset of the ordinary noncrossing partitions of $\{1, \ldots, b-1\}$. Bodnar and Rhoades (2015)…

组合数学 · 数学 2017-10-17 Michelle Bodnar

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…

组合数学 · 数学 2016-07-27 Henri Mühle

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

组合数学 · 数学 2011-08-15 Adam M. Goyt , Lara K. Pudwell

Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting…

群论 · 数学 2018-06-07 Ali Mahmoudifar , Ali Reza Moghaddamfar , Faez Salehzadeh

We present a categorification of the non-crossing partitions given by crystallographic Coxeter groups. This involves a category of certain bilinear lattices, which are essentially determined by a symmetrisable generalised Cartan matrix…

表示论 · 数学 2015-06-09 Andrew Hubery , Henning Krause

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…

组合数学 · 数学 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

We classify compact quantum groups associated to noncrossing partitions coloured with two elements $x$ and $y$ which are their own inverses. Together with the work of P. Tarrago and M. Weber, this completes the classification of all…

量子代数 · 数学 2018-06-12 Amaury Freslon

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

组合数学 · 数学 2014-09-17 N. J. A. Sloane , James A. Sellers