English
Related papers

Related papers: An efficient algorithm for deciding vanishing of S…

200 papers

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…

Combinatorics · Mathematics 2025-09-23 Igor Pak , Colleen Robichaux

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

Combinatorics · Mathematics 2021-03-09 Anshul Adve , Colleen Robichaux , Alexander Yong

We connect generalized permutahedra with Schubert calculus. Thereby, we give sufficient vanishing criteria for Schubert intersection numbers of the flag variety. Our argument utilizes recent developments in the study of Schubitopes, which…

Combinatorics · Mathematics 2022-12-06 Avery St. Dizier , Alexander Yong

Schubert coefficients are nonnegative integers $c^w_{u,v}$ that arise in Algebraic Geometry and play a central role in Algebraic Combinatorics. It is a major open problem whether they have a combinatorial interpretation, i.e, whether…

Combinatorics · Mathematics 2025-04-03 Igor Pak , Colleen Robichaux

The Schubert vanishing problem is a central decision problem in algebraic combinatorics and Schubert calculus, with applications to representation theory and enumerative algebraic geometry. The problem has been studied for over 50 years in…

Combinatorics · Mathematics 2025-04-07 Igor Pak , Colleen Robichaux

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

Combinatorics · Mathematics 2019-05-23 Anshul Adve , Colleen Robichaux , Alexander Yong

We study Schubert polynomials using geometry of infinite-dimensional flag varieties and degeneracy loci. Applications include Graham-positivity of coefficients appearing in equivariant coproduct formulas and expansions of back-stable and…

Algebraic Geometry · Mathematics 2025-02-19 David Anderson

The Schubert varieties on a flag manifold G/P give rise to a cell decomposition on G/P whose Kronecker duals, known as the Schubert classes on G/P, form an additive base of the integral cohomology of G/P. The Schubert's problem of…

Algebraic Topology · Mathematics 2020-11-02 Haibao Duan , Xuezhi Zhao

For any complex reductive connected Lie group G, many of the structure constants of the ordinary cohomology ring H^*(G/B; Z) vanish in the Schubert basis, and the rest are strictly positive. We present a combinatorial game, the ``root…

Combinatorics · Mathematics 2007-05-23 Kevin Purbhoo

Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

Define a ``truncation'' $r_{t}(p)$ of a polynomial $p$ in $\{x_1,x_2,x_3,...\}$ as the polynomial with all but the first $t$ variables set to zero. In certain good cases, the truncation of a Schubert or Grothendieck polynomial may again be…

Combinatorics · Mathematics 2007-05-23 Allen Knutson , Alexander Yong

We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…

Combinatorics · Mathematics 2020-11-17 Alex Fink , Karola Mészáros , Avery St. Dizier

We establish the formula for multiplication by the class of a special Schubert variety in the integral cohomology ring of the flag manifold. This formula also describes the multiplication of a Schubert polynomial by either an elementary…

alg-geom · Mathematics 2008-02-03 Frank Sottile

The quantum cohomology algebra of the (full) flag manifold is a fundamental example in quantum cohomology theory, with connections to combinatorics, algebraic geometry, and integrable systems. Using a differential geometric approach, we…

Differential Geometry · Mathematics 2007-05-23 A. Amarzaya , M. A. Guest

In this paper, we first discuss the topological properties of projective Stiefel manifolds, we compute their cohomology rings and classify their cohomology endomorphisms; Then by embedding the flag manifold of a classical Lie group into its…

Algebraic Topology · Mathematics 2015-12-31 Zhao Xu-an , Gao Hongzhu

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

Commutative Algebra · Mathematics 2018-06-13 Shinichi Tajima , Katsuyoshi Ohara , Akira Terui

Vanishing polynomials are polynomials over a ring which output $0$ for all elements in the ring. In this paper, we study the ideal of vanishing polynomials over specific types of rings, along with the closely related ring of polynomial…

Commutative Algebra · Mathematics 2023-10-04 Matvey Borodin , Ethan Liu , Justin Zhang

Schubert polynomials are polynomial representatives of Schubert classes in the cohomology of the complete flag variety and have a combinatorial formulation in terms of bumpless pipe dreams. Quantum double Schubert polynomials are polynomial…

Combinatorics · Mathematics 2025-02-12 Tuong Le , Shuge Ouyang , Leo Tao , Joseph Restivo , Angelina Zhang

We illuminate the relation between the Bruhat order on the symmetric group and structure constants (Littlewood-Richardson coefficients) for the cohomology of the flag manifold in terms of its basis of Schubert classes. Equivalently, the…

alg-geom · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…

Computational Complexity · Computer Science 2020-03-12 Shir Peleg , Amir Shpilka
‹ Prev 1 2 3 10 Next ›