Annular noncrossing permutations and minimal transitive factorizations
From MaRDI portal
Publication:2439578
DOI10.1016/j.jcta.2014.02.005zbMath1283.05022arXiv1201.5703OpenAlexW1973953053WikidataQ114162723 ScholiaQ114162723MaRDI QIDQ2439578
Jang Soo Kim, Heesung Shin, Seung-Hyun Seo
Publication date: 14 March 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.5703
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)
Related Items
Counting non-crossing permutations on surfaces of any genus, Reflected entropy in random tensor networks
Cites Work
- Enumerative properties of \({\mathit NC}^{(B)}(p,q)\)
- Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges
- Posets of annular non-crossing partitions of types B and D
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Reflection decompositions in the classical Weyl groups
- Minimal transitive products of transpositions---the reconstruction of a proof of A. Hurwitz
- Transitive cycle factorizations and prime parking functions
- Enumeration of planar constellations
- Parking functions of types A and B
- Tree-like properties of cycle factorizations
- Permutation factorizations and prime parking functions
- Transitive factorisations into transpositions and holomorphic mappings on the sphere