An efficient algorithm for deciding vanishing of Schubert polynomial coefficients

DOI10.1016/j.aim.2021.107669OpenAlexW3138747003MaRDI QIDQ2020382

Alexander Yong, Colleen Robichaux, Anshul Adve

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) 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) Computational aspects of higher-dimensional varieties (14Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical problems, Schubert calculus (14N15)

Related Items (3)

Reduced word enumeration, complexity, and randomization ⋮ Classifying Levi-spherical Schubert varieties ⋮ Classification of Levi-spherical Schubert varieties

Cites Work

• The complexity of computing the permanent
• Schubert polynomials and the Littlewood-Richardson rule
• Some combinatorial properties of Schubert polynomials
• Balanced labellings and Schubert polynomials
• Schubert polynomials as integer point transforms of generalized permutahedra
• Schubert polynomials, 132-patterns, and Stanley's conjecture
• Computational complexity, Newton polytopes, and Schubert polynomials
• Newton polytopes in algebraic combinatorics
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for deciding vanishing of Schubert polynomial coefficients