Sur la complexité du calcul des projections d'une courbe projective
- 1 January 1999
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 27 (7) , 3211-3220
Abstract
Our main result is that the complexity of computing linear projections of an equidimensional, but non necessarily reduced, curve (or equivalently the degree-complexity of the Gröbner basis computation for elimination orders) has its maximal value, namely Bayer’s bound mo, if and only if the smallest linear subspace containing C is a plane. If this is so, mo coincides with the degree of C and with the degree-complexity of the reverse lexicographic ordering.Keywords
This publication has 3 references indexed in Scilit:
- A theorem on refining division orders by the reverse lexicographic orderDuke Mathematical Journal, 1987
- A criterion for detectingm-regularityInventiones Mathematicae, 1987
- On a theorem of Castelnuovo, and the equations defining space curvesInventiones Mathematicae, 1983