An Algorithm to Compute the Adjoint Ideal of an Affine Plane Algebraic Curve

An Algebraic Approach to Computing Adjoi

An Algebraic Approach to Computing Adjoint Curves

✍ MICHAL MŇUK 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 545 KB

This paper describes an algebraic approach to computing the system of adjoint curves to a given absolutely irreducible plane algebraic curve. The proposed algorithm utilizes the integral closure of the coordinate ring rather than expanding neighborhood graphs using quadratic transformations.

The Hamilton nil-glamour of an affine al

The Hamilton nil-glamour of an affine algebraic plane

✍ O. V. Gerasimova; Yu. P. Razmyslov 📂 Article 📅 2010 🏛 Allerton Press Inc 🌐 English ⚖ 961 KB

Ideals, varieties, and algorithms: an in

Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra

✍ David A. Cox, John Little, Donal O’Shea 📂 Library 📅 2007 🏛 Springer 🌐 English ⚖ 3 MB

Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated? The solutions

Ideals, varieties, and algorithms: an in

Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra

✍ David A. Cox, John Little, Donal O’Shea 📂 Library 📅 2007 🏛 Springer 🌐 English ⚖ 4 MB

Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated?The solutions of

An Algorithm To Compute The Invariant Ri

An Algorithm To Compute The Invariant Ring Of A Ga-action On An Affine Variety

✍ Arno van den Essen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 159 KB

We describe an algorithm which computes the invariants of all \(G_{a}\)-actions on affine varieties, in case the invariant ring is finitely generated. The algorithm is based on a study of the kernel of a locally nilpotent derivation and some algoritlums from the theory of Gröbner bases.

Computing the minimal number of equation

Computing the minimal number of equations defining an affine curve ideal-theoretically

✍ Hans Schoutens 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 107 KB

There is an algorithm which computes the minimal number of generators of the ideal of a reduced curve C in a ne n-space over an algebraically closed ÿeld K, provided C is not a local complete intersection. The existence of such an algorithm follows from the fact that given d ∈ N, there exists d ∈ N