Approximate counting of standard set-valued tableaux
From MaRDI portal
Publication:2089063
DOI10.1016/J.TCS.2022.08.010OpenAlexW3198330523MaRDI QIDQ2089063FDOQ2089063
Authors: 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
Recommendations
Cites Work
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Random generation of combinatorial structures from a uniform distribution
- A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Probability and Computing
- A probabilistic proof of a formula for the number of Young tableaux of a given shape
- Genera of Brill-Noether curves and staircase paths in Young tableaux
- Poset edge densities, nearly reduced words, and barely set-valued tableaux
- Crystal structures for symmetric Grothendieck polynomials
- Title not available (Why is that?)
- Euler characteristics of Brill-Noether varieties
- Colored five-vertex models and Lascoux polynomials and atoms
- Reduced word enumeration, complexity, and randomization
- Set-valued tableaux and generalized Catalan numbers
Cited In (4)
This page was built for publication: Approximate counting of standard set-valued tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089063)