2000 character limit reached
Vanishing of Schubert coefficients in probabilistic polynomial time
Published 19 Sep 2025 in math.CO, cs.CC, cs.DM, and math.AG | (2509.16467v1)
Abstract: The Schubert vanishing problem asks whether Schubert structure constants are zero. We give a complete solution of the problem from an algorithmic point of view, by showing that Schubert vanishing can be decided in probabilistic polynomial time.
Paper Prompts
Sign up for free to create and run prompts on this paper.