Related papers: Certifying reality of projections
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
In order to approximate the integral $I(f)=\int_a^b f(x) dx$, where $f$ is a sufficiently smooth function, models for quadrature rules are developed using a given {\it panel} of $n (n\geq 2)$ equally spaced points. These models arise from…
Since the first famous correspondence theorem by Mikhalkin appeared in 2005, tropical geometry has allowed a parallel treatment of real and complex counting problems. A prime example are the genus 0 Gromov-Witten invariants of the plane…
A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
The paper presents (human-oriented) specification and (pen-and-paper) verification of the square root function. The function implements Newton method and uses a look-up table for initial approximations. Specification is done in terms of…
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…
Multidimensional systems are becoming increasingly important as they provide a promising tool for estimation, simulation and control, while going beyond the traditional setting of one-dimensional systems. The analysis of multidimensional…
We construct positive-genus analogues of Welschinger's invariants for many real symplectic manifolds, including the odd-dimensional projective spaces and the renowned quintic threefold. In some cases, our invariants provide lower bounds for…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…
Let $C$ be a generic complex plane plane curve with a given Newton polygon $P$. We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve $C^\vee$). We also prove…
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…
This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…
We apply numerical algebraic geometry to the invariant-theoretic problem of detecting symmetries between two plane algebraic curves. We describe an efficient equality test which determines, with "probability-one", whether or not two…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…