English
Related papers

Related papers: Continuous Noncrossing Partitions and Weighted Cir…

200 papers

Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…

Rings and Algebras · Mathematics 2021-08-05 Izuru Mori , Kenta Ueyama

Recently, it was realized that anomalies can be completely classified by topological orders, symmetry protected topological (SPT) orders, and symmetry enriched topological orders in one higher dimension. The anomalies that people used to…

Strongly Correlated Electrons · Physics 2019-11-06 Wenjie Ji , Xiao-Gang Wen

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 generalize the notion of a crossed module of groups to that of a crossed module of racks. We investigate the relation to categorified racks, namely strict 2-racks, and trunk-like objects in the category of racks, generalizing the…

Quantum Algebra · Mathematics 2014-04-02 Alissa S. Crans , Friedrich Wagemann

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

Combinatorics · Mathematics 2022-11-22 Keiichi Shigechi

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

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

Combinatorics · Mathematics 2009-11-17 Jing Qin , Christian M. Reidys

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

A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that…

Discrete Mathematics · Computer Science 2016-01-12 René van Bevern , Andreas Emil Feldmann , Manuel Sorge , Ondřej Suchý

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

Combinatorics · Mathematics 2011-02-16 Anders Claesson , Mark Dukes , Martina Kubitzke

Interest in Conformal Field Theories and Quantum Field Theory lead physicists to consider configuration spaces of marked points on the complex projective line, $Conf_{0,d}(\mathbb{P})$. In this paper, a real semi-algebraic stratification of…

Algebraic Geometry · Mathematics 2019-06-13 N. C. Combe

We study extension spaces, cotorsion pairs and their mutations in the cluster category of a marked surface without punctures. Under the one-to-one correspondence between the curves, valued closed curves in the marked surface and the…

Representation Theory · Mathematics 2012-05-09 Jie Zhang , Yu Zhou , Bin Zhu

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…

Combinatorics · Mathematics 2016-07-27 Henri Mühle

Partitions of unity in ${\mathbf R}^d$ formed by (matrix) scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the…

Functional Analysis · Mathematics 2017-10-24 Ole Christensen , Say Song Goh

This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite…

Combinatorics · Mathematics 2026-05-05 Jad Abou-Yassin

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In the present article we present a parameterization of the unitary group…

Quantum Physics · Physics 2010-08-18 Christoph Spengler , Marcus Huber , Beatrix C. Hiesmayr

A $2-$dimensional mosaic floorplan is a partition of a rectangle by other rectangles with no empty rooms. These partitions (considered up to some deformations) are known to be in bijection with Baxter permutations. A $d$-floorplan is the…

Combinatorics · Mathematics 2025-04-03 Nicolas Bonichon , Thomas Muller , Adrian Tanasa

Let $\mathcal{L}$ be the noncrossing partition lattice associated to a finite Coxeter group $W$. In this paper we construct explicit bases for the top homology groups of intervals and rank-selected subposets of $\mathcal{L}$. We define a…

Combinatorics · Mathematics 2023-01-26 Yang Zhang

Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…

Combinatorics · Mathematics 2026-01-22 Daniela Egas Santander , Matteo Santoro , Jason P. Smith