Related papers: Computing the connected components of real algebra…
We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution $\tau$,…
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak…
We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…
Let $X$ be a complex analytic manifold, $D\subset X$ a locally quasi-homogeneous free divisor, $E$ an integrable logarithmic connection with respect to $D$ and $L$ the local system of the horizontal sections of $E$ on $X-D$. In this paper…
We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…
Stream graphs model highly dynamic networks in which nodes and/or links arrive and/or leave over time. Strongly connected components in stream graphs were defined recently, but no algorithm was provided to compute them. We present here…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
A rational function on a real algebraic curve $C$ is called separating if it takes real values only at real points. Such a function defines a covering $\Bbb R C\to\Bbb{RP}^1$. Let $A_1,\dots,A_n$ be connected components of $C$. In a recent…
We show how the computer algebra system OSCAR can be used to obtain topologically correct or visually pleasing drawings of real plane algebraic curves.
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
We study the real components of modular curves. Our main result is an abstract group-theoretic description of the real components of a modular curve defined by a congruence subgroup of level N in terms of the corresponding subgroup of…
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…
Closed meanders are planar configurations of one or several disjoint closed Jordan curves intersecting a given line or curve transversely. They arise as shooting curves of parabolic PDEs in one space dimension, as trajectories of Cartesian…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…