Related papers: On the Complexity of Computing with Planar Algebra…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
We give explicit computational algorithms to construct minimal degree (always $\le 4$) ramified covers of $\Prj^1$ for algebraic curves of genus 5 and 6. This completes the work of Schicho and Sevilla (who dealt with the $g \le 4$ case) on…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
Given a planar graph $G$ and an integer $b$, OrthogonalPlanarity is the problem of deciding whether $G$ admits an orthogonal drawing with at most $b$ bends in total. We show that OrthogonalPlanarity can be solved in polynomial time if $G$…
We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…
We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…
We prove that for every integers $g, h\geq 2, n \geq 3$, for all but finitely many prime numbers $p$, for every field $k$ of characteristic $0$ or $p$, every separable family of smooth projective curves of genus $h$ over $\mathcal{A}_g(n)…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
In algebraic geometry, it is important to provide effective parametrizations for families of curves, both in theory and in practice. In this paper, we present such an effective parametrization for the moduli of genus-$5$ curves that are…
Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…
We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
Consider an algebraic equation $P(x,y)=0$ where $P\in \mathbb C[x,y] $ (or $\mathbb F[x,y]$ with $\mathbb F\subset \mathbb C$ a subfield) is a bivariate polynomial, it defines a plane algebraic curve. We provide an efficient method for…
In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…