An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
DOI10.1080/10586458.1995.10504323zbMATH Open0860.68062OpenAlexW2074469346MaRDI QIDQ4891845FDOQ4891845
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Title not available (Why is that?)
- Algebraic algorithms for sampling from conditional distributions
- A Geometric Buchberger Algorithm for Integer Programming
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Generators and relations of abelian semigroups and semigroup rings
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
- An algorithm to compute the kernel of a derivation up to a certain degree
- Minimal resolutions of lattice ideals and integer linear programming
- 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
- \(\mathbb N\)-solutions to linear systems over \(\mathbb 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
Uses Software
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)
