Related papers: Computing the connected components of real algebra…

We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer…

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…

A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…

The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…

We study conchoids to algebraic curve from the perspective of algebraic geometry, analyzing their main algebraic properties. We introduce the formal definition of conchoid of an algebraic curve by means of incidence diagrams. We prove that,…

A rigid isotopy of real algebraic curves of a certain class is a path in the space of curves of this class. The paper's study completes the rigid isotopic classification of nonsingular real algebraic curves of bidegree (4,3) on a…

We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We give an algorithm that takes as input a polynomial $Q \in \mathrm{D}[X_1,\ldots,X_k]$, and computes a description of a roadmap of the set of…

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

In the Graph Reconstruction (GR) problem, the goal is to recover a hidden graph by utilizing some oracle that provides limited access to the structure of the graph. The interest is in characterizing how strong different oracles are when the…

Algebraic curve interpolation is described by specifying the location of N points in the plane and constructing an algebraic curve of a function f that should pass through them. In this paper, we propose a novel approach to construct the…

These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…

We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

We isolate a class, say $\mathcal{A}$, of global real analytic functions such that, each global semi-analytic set defined by $\mathcal{A}$ has only finitely many connected components and each component is also a global semi-analytic set…