English

Complexity of the Zero Set of a Matrix Schubert Ideal

Algebraic Geometry 2026-05-27 v3 Combinatorics

Abstract

TT-varieties are normal varieties equipped with an action of an algebraic torus TT. When the action is effective, the complexity of a TT-variety XX is dim(X)dim(T)\dim(X)-\dim(T). Matrix Schubert varieties, introduced by Fulton in 1992, are TT-varieties consisting of n×nn \times n matrices satisfying certain constraints on the ranks of their submatrices. In this paper, we focus on the complexity of certain torus-fixed affine subvarieties of matrix Schubert varieties. Concretely, given a matrix Schubert variety Xw\overline{X_{w}} where wSnw\in S_n, we study the complexity of YwY_w obtained by the decomposition Xw=Yw×Ck\overline{X_{w}} = Y_{w} \times \mathbb{C}^{k} with kk as large as possible. Building up from results by Escobar and M\'{e}sz\'{a}ros and Donten-Bury, Escobar, and Portakal, we show that for a fixed nn, the complexity of YwY_{w} with respect to this action can be any integer between 00 and (n1)(n3)(n-1)(n-3), except 11.

Keywords

Cite

@article{arxiv.2510.00131,
  title  = {Complexity of the Zero Set of a Matrix Schubert Ideal},
  author = {Laura Escobar and Cesar Meza},
  journal= {arXiv preprint arXiv:2510.00131},
  year   = {2026}
}

Comments

11 pages, 9 figures; typos corrected, changed conventions to northwest rank conditions, and revised arguments in section 4