Noncrossing partitions
From MaRDI portal
Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) (q)-calculus and related topics (05A30) Combinatorial aspects of representation theory (05E10) Free probability and free operator algebras (46L54) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Mathematical biology in general (92B99)
A partition of \(\{1,\ldots,n\}\) is noncrossing if whenever \(1\leq a < b < c < d \leq n\) and \(a,c\) are in the same class and \(b,d\) are in the same class, then the two classes coincide. The enumerative study of noncrossing partitions was originated by G. Kreweras in his seminal 1972 paper; see \textit{G. Kreweras} [Discrete Math. 1, 333-350 (1972; Zbl 0231.05014)]. Meanwhile it turned out that the lattice of noncrossing partitions has a wide interaction with algebraic, geometric combinatorics, probability measures, mathematical biology, etc. This long paper gives a detailed survey on theoretical results on noncrossing partitions as well as its applications on different topics.
Recommendations
Cited in
(only showing first 100 items - show all)- Intervals in Catalan lattices and realizers of triangulations
- Posets of annular non-crossing partitions of types B and D
- Gray codes for non-crossing partitions and dissections of a convex polygon
- The Gram determinant of the type B Temperley-Lieb algebra
- On the structure of the lattice of noncrossing partitions
- On noncrossing and nonnesting partitions for classical reflection groups
- Some properties of crossings and partitions
- Non-crossing partitions for classical reflection groups
- A type-B associahedron.
- Transitive cycle factorizations and prime parking functions
- Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
- Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs
- Two posets of noncrossing set partitions
- Noncrossing partitions, noncrossing graphs, and q-permanental equations
- Rational noncrossing partitions for all coprime pairs
- The alternating group generated by 3-cycles
- Combinatorics of the categories of noncrossing partitions
- Reduction of \(m\)-regular noncrossing partitions
- EL-labelings, supersolvability and 0-Hecke algebra actions on posets
- Bell numbers, their relatives, and algebraic differential equations
- The cyclic sieving phenomenon
- A new matching property for posets and existence of disjoint chains
- Extremal problems for ordered hypergraphs: small patterns and some enumeration
- Asymptotic enumeration of non-crossing partitions on surfaces
- The non-commutative cycle lemma
- Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory
- The Whitney duals of a graded poset
- Palindromic Riordan arrays, classical orthogonal polynomials and Catalan triangles
- Hints of gravitational ergodicity: Berry's ensemble and the universality of the semi-classical Page curve
- Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian
- Catalan intervals and uniquely sorted permutations
- Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations
- k-indivisible noncrossing partitions
- The toric \(h\)-vector of a cubical complex in terms of noncrossing partition statistics
- Noncrossing normal ordering for functions of boson operators
- A poset structure on the alternating group generated by 3-cycles
- Ballot-noncrossing partitions
- Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity
- The antipode of the noncrossing partition lattice
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
- The pruning-grafting lattice of binary trees
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices
- New interpretations for noncrossing partitions of classical types
- Some set partition statistics in non-crossing partitions and generating functions
- Congruences for Catalan and Motzkin numbers and related sequences
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Advanced determinant calculus: a complement
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- A shuffle algebra point of view on operator-valued probability theory
- Large and small corrections to the JLMS formula from replica wormholes
- RNA secondary structures with given motif specification: combinatorics and algorithms
- Combinatorics of a generalized Narayana identity
- Noncrossing partitions with fixed points having specific properties.
- Closed expressions for averages of set partition statistics
- Note on 1-crossing partitions.
- Divided differences of inverse functions and partitions of a convex polygon
- The Catalan combinatorics of the hereditary Artin algebras
- A generating tree approach to k-nonnesting partitions and permutations
- Algorithms for non-crossing partitions
- Noncrossing Partitions in Surprising Locations
- Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform
- Invariant Peano curves of expanding Thurston maps
- Hopf algebras and the logarithm of the S-transform in free probability
- THE GRAM MATRIX OF A TEMPERLEY-LIEB ALGEBRA IS SIMILAR TO THE MATRIX OF CHROMATIC JOINS
- Polynomials, meanders, and paths in the lattice of noncrossing partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- A group action on noncrossing partitions
- A simple and direct derivation for the number of noncrossing partitions
- scientific article; zbMATH DE number 1998303 (Why is no real title available?)
- Symmetric partitions and pairings
- EL-shellability and noncrossing partitions associated with well-generated complex reflection groups
- GCD matrices, posets, and nonintersecting paths
- Matchings In Three Catalan Lattices
- A note on enumeration of noncrossing partitions.
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Merging-free partitions and run-sorted permutations
- scientific article; zbMATH DE number 7203434 (Why is no real title available?)
- Degree of the \(W\)-operator and noncrossing partitions
- Weak separation and plabic graphs
- Tree expansion in time-dependent perturbation theory
- ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
- Noncrossing partitions and the shard intersection order
- Simply generated non-crossing partitions
- Sets, Lists and Noncrossing Partitions
- scientific article; zbMATH DE number 2192149 (Why is no real title available?)
- Set partitions and non-crossing partitions with -neighbors and -isolated elements
- Dominance phenomena: mutation, scattering and cluster algebras
- Subsystem trace-distances of two random states
- The noncrossing bond poset of a graph
- The noncrossing bond poset of a graph
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity
- The category of finite strings
- Phénoménologie, représentations, combinatoire
- Rényi mutual information in quantum field theory, tensor networks, and gravity
- On noncrossing and nonnesting partitions of type \(D\)
- Limit distributions of eigenvalues for random block Toeplitz and Hankel matrices
- Charmed roots and the Kroweras complement
- Upho lattices. I: Examples and non-examples of cores
This page was built for publication: Noncrossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978192)
