Searcharxiv⌕ Search

arXiv subjects

Colleen Robichaux

Publications and source records attributed to Colleen Robichaux.

At least 19 recordsLinked to original sources
arXiv2026

Dimensions of type $A$ Hessenberg varieties over a fixed sheet

Hessenberg varieties $\mathcal{H}\mathrm{ess}(\mathsf{X},\mathbf{h})$ are subvarieties of the flag variety parameterized by a Hessenberg function $\mathbf{h}: [n] \to [n]$ and a matrix $\mathsf{X} \in \mathfrak{gl}_n(\mathbb{C})$. In recent work, Goldin and the second author showed the existence of flat degenerations of Hessenberg varieties to nilpotent Hessenberg varieties over the minimal sheet. This implies that all Hessenberg varieties over the minimal sheet have the same dimension. Our main result generalizes this dimension result to arbitrary sheets. Specifically, we prove that for a fixed Hessenberg function $\mathbf{h}:[n] \to [n]$, all Hessenberg varieties $\mathcal{H}\mathrm{ess}(\mathsf{X},\mathbf{h})$ defined in the type $A$ flag variety by linear operators $\mathsf{X}$ from the same sheet of the Lie algebra $\mathfrak{gl}_n(\mathbb{C})$ have the same dimension.

math.AG↗
arXiv2026

Saturation property fails for Schubert coefficients

The saturation property for Littlewood--Richardson coefficients was established by Knutson and Tao in 1999. In 2004, Kirillov conjectured that the saturation property extends to Schubert coefficients. We disprove this conjecture in a strong form, by showing that it fails for a large family of instances. We also discuss computational complexity implications.

math.CO↗
arXiv2025

On Vanishing of Gromov--Witten Invariants

We consider the decision problem of whether a particular Gromov--Witten invariant on a partial flag variety is zero. We prove that for the $3$-pointed, genus zero invariants, this problem is in the complexity class ${\sf AM}$ assuming the Generalized Riemann Hypothesis (GRH), and therefore lies in the second level of polynomial hierarchy ${\sf PH}$. For the proof, we construct an explicit system of polynomial equations through a translation of the defining equations. We also need to prove an extension of the Parametric Hilbert's Nullstellensatz to obtain our central reduction.

math.AG↗
arXiv2025

Signed puzzles for Schubert coefficients

We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded number of inversions.

math.CO↗
arXiv2025

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH

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 different settings, with much progress given in the last two decades. We prove that the Schubert vanishing problem is in ${\sf AM}$ assuming the Generalized Riemann Hypothesis (GRH). This complements our earlier result in arXiv:2412.02064, that the problem is in ${\sf coAM}$ assuming the GRH. In particular, this implies that the Schubert vanishing problem is unlikely to be ${\sf coNP}$-hard, as we previously conjectured in arXiv:2412.02064. The proof is of independent interest as we formalize and expand the notion of a lifted formulation partly inspired by algebraic computations of Schubert problems, and extended formulations of linear programs. We use a result by Mahajan--Vinay to show that the determinant has a lifted formulation of polynomial size. We combine this with Purbhoo's algebraic criterion to derive the result.

math.CO↗
arXiv2024

Positivity of Schubert Coefficients

Schubert coefficients $c_{u,v}^w$ are structure constants describing multiplication of Schubert polynomials. Deciding positivity of Schubert coefficients is a major open problem in Algebraic Combinatorics. We prove a positive rule for this problem based on two standard assumptions.

math.CO↗
arXiv2024

Vanishing of Schubert Coefficients

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 $c^w_{u,v} \in \#{\sf P}$. We study the closely related vanishing problem of Schubert coefficients: $\{c^w_{u,v}=^? 0\}$. Until this work it was open whether this problem is in the polynomial hierarchy ${\sf PH}$. We prove that $\{c^w_{u,v}=^? 0\}$ in ${\sf coAM}$ assuming the GRH. In particular, the vanishing problem is in ${\Sigma_2^{{\text{p}}}}$. Our approach is based on constructions lifted formulations, which give polynomial systems of equations for the problem. The result follows from a reduction to Parametric Hilbert's Nullstellensatz, recently studied in arXiv:2408.13027. We extend our results to all classical types. Type $D$ is resolved in the appendix (joint with David Speyer).

math.CO↗
arXiv2024

Signed combinatorial interpretations in algebraic combinatorics

We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert theory. The results are stated in the language of computational complexity, while the proofs are based on the effective M\"obius inversion.

math.CO↗
arXiv2023

Castelnuovo-Mumford regularity for $321$-avoiding Kazhdan-Lusztig varieties

We prove the Castelnuovo--Mumford regularity of 321-avoiding Kazhdan--Lusztig varieties can be computed combinatorially in terms of $K$-theoretic skew excited Young diagrams. We present an algorithm which gives a lower bound for this regularity and describe a setting in which this algorithm provides precise regularity computations. This algorithm specializes to compute the regularity of all two-sided mixed ladder determinantal varieties.

math.CO↗
arXiv2022

Castelnuovo-Mumford regularity of ladder determinantal varieties and patches of Grassmannian Schubert varieties

We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which appeared in previous joint work of the authors with Y. Ren and A. St. Dizier. We apply our formulas to compute Castelnuovo-Mumford regularity of classes of generalized determinantal ideals. In particular, we give combinatorial formulas for the regularities of all one-sided mixed ladder determinantal ideals. We also derive formulas for the regularities of certain Kazhdan-Lusztig ideals, including those coming from open patches of Schubert varieties in Grassmannians. This provides a correction to a conjecture of Kummini-Lakshmibai-Sastry-Seshadri (2015).

math.CO↗
arXiv2021

Shifted edge labeled tableaux and localizations

We prove cases of a conjectural rule of H. Yadav, A. Yong, and the author for structure coefficients of the D. Anderson-W. Fulton ring. In particular, we give a combinatorial description for certain localization coefficients of this ring, which is related to the equivariant cohomology of isotropic Grassmannians.

math.CO↗
arXiv2021

An efficient algorithm for deciding vanishing of Schubert polynomial coefficients

Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau criterion to solve this problem, from which we deduce the first polynomial time algorithm. These results are obtained from new characterizations of the Schubitope, a generalization of the permutahedron defined for any subset of the n x n grid. In contrast, we show that computing these coefficients explicitly is #P-complete.

math.CO↗
arXiv2021

Computational complexity, Newton polytopes, and Schubert polynomials

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, in amenable cases, nonvanishing is in the complexity class $NP\cap coNP$ of problems with "good characterizations". This suggests a new algebraic combinatorics viewpoint on complexity theory. This report discusses the case of Schubert polynomials. These form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. We give a tableau criterion for nonvanishing, from which we deduce the first polynomial time algorithm. These results are obtained from new characterizations of the Schubitope, a generalization of the permutahedron defined for any subset of the n x n grid, together with a theorem of A. Fink, K. Mészáros, and A. St. Dizier, which proved a conjecture of C. Monical, N. Tokcan, and the third author.

math.CO↗
arXiv2020

Degrees of symmetric Grothendieck polynomials and Castelnuovo-Mumford regularity

We give an explicit formula for the degree of the Grothendieck polynomial of a Grassmannian permutation and a closely related formula for the Castelnuovo-Mumford regularity of the Schubert determinantal ideal of a Grassmannian permutation. We then provide a counterexample to a conjecture of Kummini-Lakshmibai-Sastry-Seshadri on a formula for regularities of standard open patches of particular Grassmannian Schubert varieties and show that our work gives rise to an alternate explicit formula in these cases. We end with a new conjecture on the regularities of standard open patches of arbitrary Grassmannian Schubert varieties.

math.CO↗
arXiv2019

Equivariant cohomology, Schubert calculus, and edge labeled tableaux

This chapter concerns edge labeled Young tableaux, introduced by H. Thomas and the third author. It is used to model equivariant Schubert calculus of Grassmannians. We survey results, problems, conjectures, together with their influences from combinatorics, algebraic and symplectic geometry, linear algebra, and computational complexity. We report on a new shifted analogue of edge labeled tableaux. Conjecturally, this gives a Littlewood-Richardson rule for the structure constants of the D. Anderson-W. Fulton ring, which is related to the equivariant cohomology of isotropic Grassmannians.

math.CO↗
arXiv2019

The A.B.C.Ds of Schubert calculus

We collect Atiyah-Bott Combinatorial Dreams (A.B.C.Ds) in Schubert calculus. One result relates equivariant structure coefficients for two isotropic flag manifolds, with consequences to the thesis of C. Monical. We contextualize using work of N. Bergeron-F. Sottile, S. Billey-M. Haiman, P. Pragacz, and T. Ikeda-L. Mihalcea-I. Naruse. The relation complements a theorem of A. Kresch-H. Tamvakis in quantum cohomology. Results of A. Buch-V. Ravikumar rule out a similar correspondence in K-theory.

math.CO↗