Minimally generating ideals of rational parametric curves in polynomial time
From MaRDI portal
Publication:1582298
DOI10.1006/jsco.1999.0354zbMath0980.14033OpenAlexW1980725480MaRDI QIDQ1582298
Publication date: 10 March 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1999.0354
complexityalgorithmGröbner basesHilbert functionCastelnuovo-Mumford regularityminimal set of generatorsCoCoASingularideal of projective curve
Analysis of algorithms (68W40) Computational aspects of algebraic curves (14Q05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)
Related Items
Computing minimal generators of the ideal of a general projective curve, Maximal rank and minimal generation of some parametric varieties., Implicitization of differential rational parametric equations., Implicitization of a general union of parametric varieties
Uses Software
Cites Work
- A criterion for detecting m-regularity
- Hilbert functions and the Buchberger algorithm
- Linear free resolutions and minimal multiplicity
- On a theorem of Castelnuovo, and the equations defining space curves
- Implicitization of rational parametric equations
- Introduction to liaison theory and deficiency modules
- Minimally generating ideals of points in polynomial time using linear algebra
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Implicitization of rational parametric surfaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
