Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Algebraic Variety
betti number
Critical Point
Real Algebraic Geometry
Upper Bound
Related Publications
(1)
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Subscribe
Academic
Publications
Strong bihomogeneous Bézout theorem and its use in effective real algebraic geometry
Strong bihomogeneous Bézout theorem and its use in effective real algebraic geometry,Computing Research Repository,Mohab Safey El Din,Philippe Trebuc
Edit
Strong bihomogeneous Bézout theorem and its use in effective real algebraic geometry
(
Citations: 3
)
BibTex

RIS

RefWorks
Download
Mohab Safey El Din
,
Philippe Trebuchet
Let (f1; : : : ; fs) be a polynomial family in Q(X1; : : : ; Xn) (with s 6 n 1) of degree bounded by D. Suppose that hf1; : : : ; fsi generates a radical ideal, and denes a smooth
algebraic variety
V Cn. Consider a projection : Cn ! C. We prove that the degree of the critical locus of restricted to V is bounded by Ds(D 1)n s n n s . This result is obtained in two steps. First the critical points of restricted to V are characterized as projections of the solutions of Lagrange's system for which a bi homogeneous structure is exhibited. Secondly we prove a bihomogeneous B ezout Theorem, which bounds the sum of the degrees of the equidimensional compo nents of the radical of an ideal generated by a bihomogeneous polynomial family. This result is improved when (f1; : : : ; fs) is a regular sequence. Moreover, we use Lagrange's system to design an algorithm computing at least one point in each con nected component of a smooth real algebraic set. This algorithm generalizes, to the non equidimensional case, the one of Safey El Din and Schost. The evaluation of the output size of this algorithm gives new upper bounds on the rst
Betti number
of a smooth real algebraic set. Finally, we estimate its arithmetic complexity and prove that in the worst cases it is polynomial in n, s, Ds(D 1)n s n n s and the complexity of evaluation of f1; : : : ; fs.
Journal:
Computing Research Repository  CORR
, vol. abs/cs/061, 2006
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.enslyon.fr
)
(
adsabs.harvard.edu
)
(
www.informatik.unitrier.de
)
(
arxiv.org
)
More »
Citation Context
(1)
...We make use of the results of [
19
] which shows how to use Lagrange’s system in conjunction with Lecerf’s results [16] to improve the complexity of computing critical points and [16] which bounds the complexity of computing a lifted curve as a parametrized geometric resolution of 1dimensional variety dened by polynomials of degree D by D O(n) ...
Marc MEZZAROBBA
.
Computing Roadmaps in Smooth Real Algebraic Sets
References
(24)
Real Solving for Positive Dimensional Systems
(
Citations: 31
)
Philippe Aubry
,
Fabrice Rouillier
,
Mohab Safey El Din
Journal:
Journal of Symbolic Computation  JSC
, vol. 34, no. 6, pp. 543560, 2002
The Complexity of Partial Derivatives
(
Citations: 178
)
Walter Baur
,
Volker Strassen
Journal:
Theoretical Computer Science  TCS
, vol. 22, no. 3, pp. 317330, 1983
Polar varieties and efficient real equation solving: the hypersurface case
(
Citations: 13
)
B. Bank
,
M. Giusti
,
J. Heintz
,
G. M. Mbakop
Journal:
Journal of Complexity
, 1997
Polar varieties and efficient real elimination
(
Citations: 15
)
B. Bank
,
M. Giusti
,
J. Heintz
,
G. M. Mbakop
Published in 2001.
On the combinatorial and algebraic complexity of quantifier elimination
(
Citations: 166
)
Saugata Basu
,
Richard Pollack
,
MarieFrançoise Roy
Journal:
Journal of The ACM  JACM
, vol. 43, no. 6, pp. 10021045, 1996
Sort by:
Citations
(3)
Variétés bipolaires et résolution d'une équation polynomiale réelle
(
Citations: 1
)
Bernd Bank
,
Marc Giusti
,
Joos Heintz
,
Luis Miguel Pardo
Published in 2009.
On the intrinsic complexity of point finding in real singular hypersurfaces
Bernd Bank
,
Marc Giusti
,
Joos Heintz
,
Luis Miguel Pardo
Journal:
Information Processing Letters  IPL
, vol. 109, no. 19, pp. 11411144, 2009
Computing Roadmaps in Smooth Real Algebraic Sets
Marc MEZZAROBBA