An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms

DOI10.1080/10586458.1995.10504323zbMath0860.68062OpenAlexW2074469346MaRDI QIDQ4891845

Fausto Di Biase, Ruediger Urbanke

Publication date: 13 April 1997

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1062621080

zbMATH Keywords

Gröbner basismonomialsalgorithm complexitykernel of a polynomial map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

A study of a family of monomial ideals ⋮ Minimal resolutions of lattice ideals and integer linear programming ⋮ Computing generating sets of lattice ideals and Markov bases of lattices ⋮ On the ideal associated to a linear code ⋮ An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals ⋮ GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS ⋮ FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE ⋮ The regularity of a toric variety ⋮ Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations. ⋮ Computing resolutions of quotient singularities ⋮ \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)

Uses Software

• Mathematica
• PARI/GP
• GRIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic algorithms for sampling from conditional distributions
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Generators and relations of abelian semigroups and semigroup rings
• A Geometric Buchberger Algorithm for Integer Programming