Related papers: Polynomial systems supported on circuits and dessi…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
In this paper we develop symbolic computation algorithms to investigate finiteness of central configurations for the planar $n$-body problem. Our approach is based on Albouy-Kaloshin's work on finiteness of central configurations for the…
Connected components of real algebraic varieties invariant under the $CB_{n}$-Coxeter group are investigated. In particular, we consider their maximal number and their geometric and topological properties. This provides a decomposition for…
Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…
How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper we are concerned with determining lower bounds of the number of limit cycles for piecewise polynomial holomorphic systems with a straight line of discontinuity. We approach this problem with different points of view: study of…
Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…
We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in which the variables are required to satisfy digital restrictions in a given base. Certain sets of permitted digits, namely those giving rise to…
Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…
The number of positive solutions of a system of two polynomials in two variables defined in the field of real numbers with a total of five distinct monomials cannot exceed 15. All previously known examples have at most 5 positive solutions.…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
In a recent work, the present author developed an efficient method to find the number of solutions of $ax+by+cz=n$ in non-negative integer triples $(x,y,z)$ where $a,b,c$ and $n$ are given natural numbers. In this note, we use that formula…
In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone circuit C to…
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j…