An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms

DOI10.1080/10586458.1995.10504323MaRDI QIDQ4891845zbMATH OpenOpenAlexFDO

Authors 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, https://eudml.org/doc/223444, http://www.emis.de/journals/EM/expmath/volumes/4/4.html

zbMATH Keywords

monomialsalgorithm complexityGröbner basiskernel 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)

Recommendations

• An algorithm to compute the kernel of a derivation up to a certain degree
• An algorithm for the Quillen-Suslin theorem for quotients of polnomial rings by monomial ideals
• An algorithm to compute the kernel of a derivation up to a certain degree
• scientific article; zbMATH DE number 3930348
• Computing Gröbner Bases within Linear Algebra

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 4098590 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• A Geometric Buchberger Algorithm for Integer Programming
• Algebraic algorithms for sampling from conditional distributions
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Generators and relations of abelian semigroups and semigroup rings
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points

Cited in

(15)

• An algorithm for polynomial multiplication that does not depend on the ring constants
• A study of a family of monomial ideals
• Computing generating sets of lattice ideals and Markov bases of lattices
• Computing resolutions of quotient singularities
• Minimal resolutions of lattice ideals and integer linear programming
• An algorithm to compute the kernel of a derivation up to a certain degree
• A polynomial time algorithm to compute the Abelian kernel of a finite monoid
• FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
• On the ideal associated to a linear code
• N-solutions to linear systems over Z
• Generalized reduction to compute toric ideals
• Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
• An algorithm to compute the kernel of a derivation up to a certain degree
• The regularity of a toric variety

Describes a project that uses

Uses Software

• GRIN
• PARI/GP
• Mathematica

This page was built for publication: An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891845)