Algorithms for strongly stable ideals
From MaRDI portal
Abstract: Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers among saturated ideals with a given Hilbert polynomial, in this note we present three algorithms to produce all strongly stable ideals with certain prescribed properties: the saturated strongly stable ideals with a given Hilbert polynomial, the almost lexsegment ideals with a given Hilbert polynomial, and the saturated strongly stable ideals with a given Hilbert function. We also establish results for estimating the complexity of our algorithms.
Recommendations
Cites work
- A criterion for detecting m-regularity
- A stratification of Hilbert schemes by initial ideals and applications
- Borel generators
- Comparing Castelnuovo-Mumford regularity and extended degree: The borderline cases
- Componentwise linear ideals
- Connectedness of Hilbert scheme
- Deformation classes of graded modules and maximal Betti numbers
- Eine Bedingung für die Flachheit und das Hilbertpolynom eines graduierten Ringes
- Gotzmann ideals of the polynomial ring
- scientific article; zbMATH DE number 4181496 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1305008 (Why is no real title available?)
- scientific article; zbMATH DE number 591021 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1036385 (Why is no real title available?)
- scientific article; zbMATH DE number 829964 (Why is no real title available?)
- Maximum betti numbers of homogeneous ideals with a given hilbert function
- Minimal resolutions of some monomial ideals
- Monomial Ideals
- Segments and Hilbert schemes of points
- Sharp upper bounds for the Betti numbers of a given Hilbert polynomial
- The depth of an ideal with a given Hilbert function
- Upper bounds for the betti numbers of a given hilbert function
Cited in
(18)- Bar code for monomial ideals
- Hilbert schemes with two Borel-fixed points
- The ubiquity of smooth Hilbert schemes
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Strongly stable ideals and Hilbert polynomials
- The Gröbner fan of the Hilbert scheme
- Syzygies in Hilbert schemes of complete intersections
- On the structure of Ext groups of strongly stable ideals
- Polynomial complexity for Hilbert series of Borel type ideals
- ACTION OF THE BOREL GROUP ON MONOMIAL IDEALS
- When the positivity of the \(h\)-vector implies the Cohen-Macaulay property
- An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
- Macaulay-like marked bases
- Hilbert schemes with two Borel-fixed points in arbitrary characteristic
- Shift modules, strongly stable ideals, and their dualities
- Algorithms for computing multiplier ideals
- Quaternary quartic forms and Gorenstein rings
- Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
This page was built for publication: Algorithms for strongly stable ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189437)
