Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complexity of the Zero Set of a Matrix Schubert Ideal

Published 30 Sep 2025 in math.AG and math.CO | (2510.00131v1)

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×C<sup>k\overline{X_{w}} = Y_{w} \times \mathbb{C}<sup>{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 $0$ and (n1)(n3)(n-1)(n-3), except $1$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.