Papers
Topics
Authors
Recent
Search
2000 character limit reached

Matrix orbit closures

Published 7 Jun 2013 in math.AG, math.AC, and math.CO | (1306.1810v6)

Abstract: Let $G$ be the group $GL_r(C) \times (C\times)n$. We conjecture that the finely-graded Hilbert series of a $G$ orbit closure in the space of $r$-by-$n$ matrices is wholly determined by the associated matroid. In support of this, we prove that the coefficients of this Hilbert series corresponding to certain hook-shaped Schur functions in the $GL_r(C)$ variables are determined by the matroid, and that the orbit closure has a set-theoretic system of ideal generators whose combinatorics are also so determined. We also discuss relations between these Hilbert series for related matrices, including their stabilizing behaviour as $r$ increases.

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.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.