Pages that link to "Item:Q2306519"
From MaRDI portal
The following pages link to Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519):
Displayed 7 items.
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients (Q2020382) (← links)
- Lattice polytopes from Schur and symmetric Grothendieck polynomials (Q2034074) (← links)
- The A-B-C-Ds of Schubert calculus (Q2055239) (← links)
- Generalized permutahedra and Schubert calculus (Q2101710) (← links)
- Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519) (← links)
- Newton polytopes in algebraic combinatorics (Q2334606) (← links)
- Classification of Levi-spherical Schubert varieties (Q6166758) (← links)