Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.