An efficient algorithm for deciding vanishing of Schubert polynomial coefficients

DOI10.1016/J.AIM.2021.107669MaRDI QIDQ2020382zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitySchubert polynomialgeneralized permutahedra

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 3779503 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 2135025 (Why is no real title available?)
• Balanced labellings and Schubert polynomials
• Computational complexity, Newton polytopes, and Schubert polynomials
• Newton polytopes in algebraic combinatorics
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Schubert polynomials and the Littlewood-Richardson rule
• Schubert polynomials as integer point transforms of generalized permutahedra
• Schubert polynomials, 132-patterns, and Stanley's conjecture
• Some combinatorial properties of Schubert polynomials
• Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
• The complexity of computing the permanent

Cited in

(10)

• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
• Generalized permutahedra and Schubert calculus
• Computational complexity, Newton polytopes, and Schubert polynomials
• Classifying Levi-spherical Schubert varieties
• Zero-one Schubert polynomials
• Classification of Levi-spherical Schubert varieties
• Vanishing of Littlewood-Richardson polynomials is in P
• An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
• Reduced word enumeration, complexity, and randomization

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)