Complexity of the Zero Set of a Matrix Schubert Ideal
Abstract
-varieties are normal varieties equipped with an action of an algebraic torus . When the action is effective, the complexity of a -variety is . Matrix Schubert varieties, introduced by Fulton in 1992, are -varieties consisting of 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 where , we study the complexity of obtained by the decomposition with 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 , the complexity of with respect to this action can be any integer between and , except .
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