Strongly stable ideals and Hilbert polynomials
Davide Alberelli, Paolo Lella
TL;DR
This paper introduces a Macaulay2 package that efficiently computes all saturated strongly stable ideals with a specified Hilbert polynomial, aiding algebraic geometry research.
Contribution
It presents a new computational method and tools for enumerating saturated strongly stable ideals with a given Hilbert polynomial.
Findings
Implementation of the StronglyStableIdeals package in Macaulay2
Efficient enumeration of strongly stable ideals for fixed Hilbert polynomials
Detailed description of the main algorithm and auxiliary tools
Abstract
The \texttt{StronglyStableIdeals} package for \textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary tools is given.
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.