pith. sign in

arxiv: 2510.00131 · v3 · pith:LCGGYDEJnew · submitted 2025-09-30 · 🧮 math.AG · math.CO

Complexity of the Zero Set of a Matrix Schubert Ideal

classification 🧮 math.AG math.CO
keywords complexityvarietiesmatrixschubertactioncertainescobaroverline
0
0 comments X
read the original abstract

$T$-varieties are normal varieties equipped with an action of an algebraic torus $T$. When the action is effective, the complexity of a $T$-variety $X$ is $\dim(X)-\dim(T)$. Matrix Schubert varieties, introduced by Fulton in 1992, are $T$-varieties consisting of $n \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 $\overline{X_{w}}$ where $w\in S_n$, we study the complexity of $Y_w$ obtained by the decomposition $\overline{X_{w}} = Y_{w} \times \mathbb{C}^{k}$ with $k$ 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 $n$, the complexity of $Y_{w}$ with respect to this action can be any integer between $0$ and $(n-1)(n-3)$, except $1$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.