Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
Cristina Bertone, Francesca Cioffi, Paolo Lella, Margherita Roggero

TL;DR
This paper introduces improved computational methods for marked schemes associated with strongly stable ideals, enabling explicit calculations and embeddings into affine spaces, with applications to Hilbert schemes.
Contribution
It develops a new reduction relation called superminimal reduction to compute equations of marked schemes more efficiently and characterizes when certain embeddings are isomorphisms.
Findings
New superminimal reduction simplifies equations of marked schemes.
Explicit embeddings of marked schemes into low-dimensional affine spaces.
Characterization of the minimal m for isomorphisms between marked schemes.
Abstract
Let be a monomial strongly stable ideal. The collection of the homogeneous polynomial ideals , such that the monomials outside form a -vector basis of , is called a {\em -marked family}. It can be endowed with a structure of affine scheme, called a {\em -marked scheme}. For special ideals , -marked schemes provide an open cover of the Hilbert scheme , where is the Hilbert polynomial of . Those ideals more suitable to this aim are the -truncation ideals generated by the monomials of degree in a saturated strongly stable monomial ideal . Exploiting a characterization of the ideals in in terms of a Buchberger-like criterion, we compute the equations defining the -marked scheme by a new reduction…
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 · Algebraic Geometry and Number Theory · Polynomial and algebraic computation
