Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · alg-geom/9609004

Polar Varieties, Real Equation Solving and Data-Structures: The hypersurface case

B. Bank·M. Giusti·J. Heintz·G. M. Mbakop
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we apply for the first time a new method for multivariate equation solving which was developed in \cite{gh1}, \cite{gh2}, \cite{gh3} for complex root determination to the {\em real} case. Our main result concerns the problem of finding at least one representative point for each connected component of a real compact and smooth hypersurface. The basic algorithm of \cite{gh1}, \cite{gh2}, \cite{gh3} yields a new method for symbolically solving zero-dimensional polynomial equation systems over the complex numbers. One feature of central importance of this algorithm is the use of a problem--adapted data type represented by the data structures arithmetic network and straight-line program (arithmetic circuit). The algorithm finds the complex solutions of any affine zero-dimensional equation system in non-uniform sequential time that is {\em polynomial} in the length of the input (given in straight--line program representation) and an adequately defined {\em geometric degree of the equation system}. Replacing the notion of geometric degree of the given polynomial equation system by a suitably defined {\em real (or complex) degree} of certain polar varieties associated to the input equation of the real hypersurface under consideration, we are able to find for each connected component of the hypersurface a representative point (this point will be given in a suitable encoding). The input equation is supposed to be given by a straight-line program and the (sequential time) complexity of the algorithm is polynomial in the input length and the degree of the polar varieties mentioned above.

Explore related subjects

alg-geommath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

B. Bank, M. Giusti, J. Heintz, G. M. Mbakop. 1996-09-06. Polar Varieties, Real Equation Solving and Data-Structures: The hypersurface case. https://arxiv.org/abs/alg-geom/9609004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2019

Classification of Varieties with Canonical Curve Section via Gaussian maps on Canonical Curves

Let $C \subset P^{g-1}$ be a smooth canonical curve of genus $g \geq 3$. The purpose of this article is to further develop a method to classify varieties having $C$ as their curve section, using Gaussian map computations. In a previous article a careful analysis of the degeneration to the cone over the hyperplane section was made for _prime_ Fano threefolds, that is Fano threefolds whose Picard group is generated by the hyperplane bundle. In this article we extend this method and classify Fano threefolds of higher index (which still have Picard number one). We are also able to classify Mukai varieties, i.e. varieties of dimension four or more with canonical curve sections.

alg-geom↗
arXiv2017

Boundedness and $K^2$ for log surfaces

Let $ε, C$ be two positive real numbers, and $\mathcal C \subset \mathbb R$ be a DCC (descending chain condition) set. Let $(X, B = \sum b_j B_j)$ denote a projective surface with an $\mathbb R$-divisor. Then (1) The class $\{X\}$ of surfaces for which there exists a divisor $B$ such that $(X,B)$ is $ε$-log terminal and $-(K_X + B)$ is nef (excluding only those for which at the same time $K_X\equiv 0$, $B=0$, and $X$ has at worst Du Val singularities), is bounded. (2) The set $\{(K_X + B)^2\}$ of squares for the semi log canonical pairs $(X, B)$ with ample $K_X + B$ and $b_j \in \mathcal C$, is a DCC set. (3) The class $\{(X,B)\}$ of pairs such that $(X, B)$ is semi log canonical, $K_X + B$ is ample, $(K_X + B)^2 = C$ and $b_j \in \mathcal C$, is bounded.

alg-geom↗