Computation of Hilbert functions

DOI10.1016/0747-7171(92)90024-XzbMath0763.13007MaRDI QIDQ1199706

Michael Stillman, David Bayer

Publication date: 16 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

complexitycomputing the Hilbert functiondimension polynomial ideal

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)

Related Items (41)

Finding sparse systems of parameters ⋮ Sets of special subvarieties of bounded degree ⋮ On the Hilbert series of the tangent cones for some 4-generated pseudosymmetric monomial curves ⋮ Unnamed Item ⋮ Reverse search for monomial ideals ⋮ Gröbner bases and cocyclic Hadamard matrices ⋮ On the computation of versal deformations ⋮ Associated primes and arithmetic degrees ⋮ Computation of Hilbert-Poincaré series ⋮ Invariants of \(S_ 4\) and the shape of sets of vectors ⋮ On the Jacobian ideal of a trilinear form ⋮ An algorithm for the hilbert-samuel function of a primary ideal ⋮ The dimension method in elementary and differential geometry ⋮ A formal theory of matrix primeness ⋮ Monomial curve families supporting Rossi's conjecture ⋮ 4-generated pseudo symmetric monomial curves with not Cohen–Macaulay tangent cones ⋮ Hilbert series of tangent cones for Gorenstein monomial curves in A4(K) ⋮ Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids ⋮ Methods for computing in algebraic geometry and commutative algebra ⋮ Computing the degree of a lattice ideal of dimension one ⋮ A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma ⋮ Commutative algebra of generalised Frobenius numbers ⋮ INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE ⋮ On arithmetic Macaulayfication of Noetherian rings ⋮ Two remarks on independent sets ⋮ Direct methods for primary decomposition ⋮ A family of metrics for biopolymers based on counting independent sets ⋮ Efficient Algorithms for Computing Nœther Normalization ⋮ Finite Rings with Applications ⋮ Computing the support of monomial iterated mapping cones ⋮ On Macaulayfication of Noetherian schemes ⋮ Multigraded Hilbert series of noncommutative modules ⋮ Orbit Closures of Linear Algebraic Groups ⋮ The slice algorithm for irreducible decomposition of monomial ideals ⋮ Gröbner bases, invariant theory and equivariant dynamics ⋮ Gluing and Hilbert functions of monomial curves ⋮ Symbolic blowup algebras and invariants of certain monomial curves in an affine space ⋮ Quasi complete intersections, powers of ideals and deficiency modules ⋮ On the Cohen–Macaulayness of tangent cones of monomial curves inA4(K) ⋮ On the complexity of counting components of algebraic varieties ⋮ Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method

Uses Software

• Macaulay2

Cites Work

• A criterion for detecting m-regularity
• Minimal resolutions of some monomial ideals
• A theorem on refining division orders by the reverse lexicographic order
• On the complexity of computing syzygies
• Hilbert functions of graded algebras
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of Hilbert functions