An algorithm to compute the adjoint ideal of an affine plane algebraic curve
From MaRDI portal
Publication:475414
DOI10.1007/s11786-014-0193-xzbMath1305.14026OpenAlexW2040472028MaRDI QIDQ475414
Zakari Yaou Moussa, M'hammed El Kahoui
Publication date: 27 November 2014
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-014-0193-x
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of algebraic curves (14Q05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametrization of algebraic curves defined by sparse equations
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Parametrization of algebraic curves over optimal field extensions
- An algebraic approach to computing adjoint curves
- Ideal basis and primary decompositions: case of two variables
- An algorithm for computing an integral basis in an algebraic function field
- Factoring bivariate polynomials using adjoints
- An Arithmetic Theory of Adjoint Plane Curves
- Computing Riemann matrices of algebraic curves
This page was built for publication: An algorithm to compute the adjoint ideal of an affine plane algebraic curve