Asymptotically maximal Schubitopes
Jack Chen-An Chou, Linus Setiabrata

TL;DR
This paper determines the asymptotic growth rates of the support sizes of Schubert and Grothendieck polynomials for specific layered permutations, revealing exponential and super-exponential behaviors.
Contribution
It identifies particular layered permutations with support sizes growing at specific asymptotic rates, providing new bounds for the maximal support sizes of these polynomials.
Findings
Support size of Schubert polynomials grows at least as fast as n!/4^n.
Support size of Grothendieck polynomials grows at least as fast as n!/e^{\sqrt{2n} \\ln(n)}.
Provides precise asymptotics for the growth rates of maximal support sizes.
Abstract
We find a layered permutation whose Schubert polynomial has support of size asymptotically at least . This gives precise asymptotics for the growth rate of . We find a different layered permutation whose Grothendieck polynomial has support of size asymptotically at least and obtain more precise asymptotics for the growth rate of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Geometric and Algebraic Topology · Mathematical Dynamics and Fractals
