An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme

DOI10.1145/2442829.2442865zbMath1323.68611arXiv1205.0456OpenAlexW2963365100MaRDI QIDQ5244541

Paolo Lella

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.0456

zbMATH Keywords

Hilbert schemeHilbert polynomialBorel-fixed ideals

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Parametrization (Chow and Hilbert schemes) (14C05)

Related Items (16)

Sets of special subvarieties of bounded degree ⋮ On the functoriality of marked families ⋮ Gorenstein rings generated by strongly stable sets of quadratic monomials ⋮ Smoothable Gorenstein Points Via Marked Schemes and Double-generic Initial Ideals ⋮ Minimal Castelnuovo–Mumford Regularity for a Given Hilbert Polynomial ⋮ The Gröbner fan of the Hilbert scheme ⋮ Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial ⋮ Shift modules, strongly stable ideals, and their dualities ⋮ When the positivity of the \(h\)-vector implies the Cohen-Macaulay property ⋮ Combinatorial decompositions for monomial ideals ⋮ Double-generic initial ideal and Hilbert scheme ⋮ Bar code for monomial ideals ⋮ Macaulay-like marked bases ⋮ StronglyStableIdeals ⋮ Strongly stable ideals and Hilbert polynomials ⋮ Hilbert schemes with two Borel-fixed points

This page was built for publication: An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme