Approximate counting of standard set-valued tableaux
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1342087 (Why is no real title available?)
- A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A probabilistic proof of a formula for the number of Young tableaux of a given shape
- Colored five-vertex models and Lascoux polynomials and atoms
- Crystal structures for symmetric Grothendieck polynomials
- Euler characteristics of Brill-Noether varieties
- Genera of Brill-Noether curves and staircase paths in Young tableaux
- Poset edge densities, nearly reduced words, and barely set-valued tableaux
- Probability and Computing
- Random generation of combinatorial structures from a uniform distribution
- Reduced word enumeration, complexity, and randomization
- Set-valued tableaux and generalized Catalan numbers
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
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)