Ideals defining components of two-row Springer fibers

Cristina Sabando-Alvarez; Martha Precup

Home/Archive/arXiv

arXiv · 2606.07507

Ideals defining components of two-row Springer fibers

Cristina Sabando-Alvarez·Martha Precup

View original source ↗Read source document ↗Export metadata ↓

Abstract

Springer fibers are subvarieties of the flag variety parameterized by nilpotent matrices. They are central objects of study in geometry representation theory. This paper focuses on two-row Springer fibers, those corresponding to nilpotent matrices with two Jordan blocks. Irreducible components of two-row Springer fibers are in bijection with two-row standard Young tableaux and also with noncrossing matchings. Inspired by the combinatorial commutative algebra of matrix Schubert varieties, we define a polynomial ideal for each noncrossing matching and prove that these ideals define the corresponding components of the Springer fiber. Our proofs leverage geometric descriptions of Springer fibers established by Fung, Stroppel--Webster, Fresse, and Goldwasser--Nadeem--Sun--Tymoczko. Using these ideals to compute examples, we give two conjectural formulas for the cohomology class of each component of a two-row Springer fiber. We apply commutative algebra techniques to prove these conjectures for a specific family of two-row tableaux.

Explore related subjects

math.CO math.AC math.AG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Cristina Sabando-Alvarez, Martha Precup. 2026-06-05. Ideals defining components of two-row Springer fibers. https://arxiv.org/abs/2606.07507

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗

arXiv2026

Enumeration of regular multipartite hypergraphs

We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.

math.CO↗

arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗