The matroid stratification of the Hilbert scheme of points on P^1
Rob Silversmith

TL;DR
This paper investigates the matroid stratification of the Hilbert scheme of points on P^1, revealing its structure through examples, visualization techniques, and connections to Schur polynomials, with applications to the T-graph problem.
Contribution
It introduces a detailed study of matroid stratifications on Hilbert schemes, especially for points on P^1, and links these structures to Schur polynomials and the T-graph problem.
Findings
Matroid stratification in the Hilbert scheme of points on P^1 is generated by Schur polynomials.
Provided visualization methods for matroid strata.
Established the existence of an infinite class of edges in the T-graph problem.
Abstract
Given a homogeneous ideal in a polynomial ring over a field, one may record, for each degree and for each polynomial , the set of monomials in with nonzero coefficients. These data collectively form the tropicalization of . Tropicalizing ideals induces a "matroid stratification" on any (multigraded) Hilbert scheme. Very little is known about the structure of these stratifications. In this paper, we explore many examples of matroid strata, including some with interesting combinatorial structure, and give a convenient way of visualizing them. We show that the matroid stratification in the Hilbert scheme of points is generated by all Schur polynomials in variables. We end with an application to the -graph problem of ; classifying this graph is a longstanding open problem, and we establish the existence of an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
