Approximate counting of standard set-valued tableaux
From MaRDI portal
Publication:2089063
DOI10.1016/j.tcs.2022.08.010OpenAlexW3198330523MaRDI QIDQ2089063
Reuven Hodges, Gidon Orelowitz
Publication date: 6 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.12457
Cites Work
- Unnamed Item
- Unnamed Item
- Poset edge densities, nearly reduced words, and barely set-valued tableaux
- Random generation of combinatorial structures from a uniform distribution
- A probabilistic proof of a formula for the number of Young tableaux of a given shape
- A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
- Reduced word enumeration, complexity, and randomization
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Colored five‐vertex models and Lascoux polynomials and atoms
- Genera of Brill-Noether curves and staircase paths in Young tableaux
- Set-Valued Tableaux & Generalized Catalan Numbers
- Euler characteristics of Brill-Noether varieties
- Probability and Computing
- Crystal structures for symmetric Grothendieck polynomials
