An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
DOI10.1016/J.AIM.2021.107669OpenAlexW3138747003MaRDI QIDQ2020382FDOQ2020382
Authors: Anshul Adve, Colleen Robichaux, Alexander Yong 
Publication date: 23 April 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05195
Recommendations
- Computational complexity, Newton polytopes, and Schubert polynomials
- Generalized permutahedra and Schubert calculus
- Vanishing of Littlewood-Richardson polynomials is in P
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Grassmannians, Schubert varieties, flag manifolds (14M15) Classical problems, Schubert calculus (14N15) Computational aspects of higher-dimensional varieties (14Q15)
Cites Work
- Title not available (Why is that?)
- The complexity of computing the permanent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- Title not available (Why is that?)
- Some combinatorial properties of Schubert polynomials
- Balanced labellings and Schubert polynomials
- Schubert polynomials and the Littlewood-Richardson rule
- Title not available (Why is that?)
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Newton polytopes in algebraic combinatorics
- Schubert polynomials, 132-patterns, and Stanley's conjecture
- Schubert polynomials as integer point transforms of generalized permutahedra
- Computational complexity, Newton polytopes, and Schubert polynomials
Cited In (10)
- Generalized permutahedra and Schubert calculus
- Classifying Levi-spherical Schubert varieties
- Computational complexity, Newton polytopes, and Schubert polynomials
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
- Zero-one Schubert polynomials
- Classification of Levi-spherical Schubert varieties
- Vanishing of Littlewood-Richardson polynomials is in P
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- Reduced word enumeration, complexity, and randomization
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
This page was built for publication: An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020382)
