English
Related papers

Related papers: On Noncrossing and nonnesting partitions of type D

200 papers

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

Group Theory · Mathematics 2022-11-28 Barbara Baumeister , Derek F. Holt , Georges Neaime , Sarah Rees

We consider mixed Hodge module structures on GKZ-hypergeometric differential systems. We show that the Hodge filtration on these D-modules is given by the order filtration, up to suitable shift. As an application, we prove a conjecture on…

Algebraic Geometry · Mathematics 2020-04-16 Thomas Reichelt , Christian Sevenheck

We show that for piecewise hereditary algebras, the periodicity of the Coxeter transformation implies the non-negativity of the Euler form. Contrary to previous assumptions, the condition of piecewise heredity cannot be omitted, even for…

Representation Theory · Mathematics 2008-05-26 Sefi Ladkani

In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…

Combinatorics · Mathematics 2009-10-15 Jing Qin , Christian M. Reidys

A \emph{set partition} of the set $[n]=\{1,...c,n\}$ is a collection of disjoint blocks $B_1,B_2,...c, B_d$ whose union is $[n]$. We choose the ordering of the blocks so that they satisfy $\min B_1<\min B_2<...b<\min B_d$. We represent such…

Combinatorics · Mathematics 2007-05-23 Vit Jelinek , Toufik Mansour

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

A Coxeter group acts properly and cocompactly by isometries on the Davis complex for the group; we call the quotient of the Davis complex under this action the Davis orbicomplex for the group. We prove the set of finite covers of the Davis…

Geometric Topology · Mathematics 2017-09-14 Emily Stark

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…

Combinatorics · Mathematics 2026-02-24 Jie Wen , Benjian Lv

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

Combinatorics · Mathematics 2009-06-17 Alain Goupil

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

Combinatorics · Mathematics 2022-05-30 Bruce E. Sagan , Joshua P. Swanson

Consider 2n points on the unit circle and a reference dissection D of the convex hull of the odd points. The accordion complex of D is the simplicial complex of subsets of pairwise noncrossing diagonals with even endpoints that cross a…

Combinatorics · Mathematics 2017-08-21 Thibault Manneville

Let $v_d(\mathbb{P}^2)\subset |\mathcal{O}_{\mathbb{P}^2}(d)|$ denote the $d$-uple Veronese surface. After studying some general aspects of the wall-crossing phenomena for stability conditions on surfaces, we are able to describe a sequence…

Algebraic Geometry · Mathematics 2017-08-31 Cristian Martinez

We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

Combinatorics · Mathematics 2008-09-16 Patricia Hersh

We introduce a class of affine Deligne--Lusztig varieties that we call of positive Coxeter type. We show that the affine Deligne--Lusztig varieties of positive Coxeter type have a very simple and explicitly described geometric structure.…

Algebraic Geometry · Mathematics 2026-03-04 Felix Schremmer , Ryosuke Shimada , Qingchao Yu

Let W be a 2-dimensional right-angled Coxeter group. We characterise such W with linear and quadratic divergence, and construct right-angled Coxeter groups with divergence polynomial of arbitrary degree. Our proofs use the structure of…

Group Theory · Mathematics 2013-06-19 Pallavi Dani , Anne Thomas

We study Coxeter groups from which there is a natural map onto a symmetric group. Such groups have natural quotient groups related to presentations of the symmetric group on an arbitrary set $T$ of transpositions. These quotients, denoted…

Group Theory · Mathematics 2007-05-23 Louis H. Rowen , Mina Teicher , Uzi Vishne

Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and colored Motzkin paths. A (3,2)-Motzkin path can be viewed as a colored…

Combinatorics · Mathematics 2010-09-02 William Y. C. Chen , Carol J. Wang

In this paper I present some open problems on Coxeter groups and unimodality, together with the main partial results, and computational evidence, that are known about them.

Combinatorics · Mathematics 2024-10-15 Francesco Brenti