Related papers: Tschirnhaus transformations after Hilbert

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…

We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…

In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…

The motivation behind this note, is due to the non success in finding the complete solution to the General Quintic Equation. The hope was to have a solution with all the parameters precisely calculated in a straight forward manner. This…

We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…

This dissertation is devoted to the resolution of the Plateau problem in the case of polygonal boundary curves in three-dimensional Euclidean space. It relies on the method developed by Ren\'e Garnier and published in 1928 in a paper which…

We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…

The Hilbert scheme $\mathbf{Hilb}_{p(t)}^{n}$ parametrizes closed subschemes and families of closed subschemes in the projective space $\mathbb{P}^n$ with a fixed Hilbert polynomial $p(t)$. It is classically realized as a closed subscheme…

In 1888, Hilbert proved that every non-negative quartic form f=f(x,y,z) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up…

Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

We prove the following form of the Clemens conjecture in low degree. Let $d\le9$, and let $F$ be a general quintic threefold in $\IP^4$. Then (1)~the Hilbert scheme of rational, smooth and irreducible curves of degree $d$ on $F$ is finite,…

Let $k$ be a field and let $V$ be a $k$-vector space of dimension $d$. Let $G \subseteq GL(V)$ be a finite group. Let $r = \dim_k (V^*)^G$. Assume $r \geq 1$. Let $R = k[V]^G$ be the ring of invariants of $G$. Let $H_R(n) =…

The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(d,n)$ of order $n$ is studied. By computational experiments and a known result for $d=2$, we conjecture that the real part of every roots of the Ehrhart polynomial of $\Delta(d,n)$…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

We construct new relativistic linear differential equation in $d$ dimensions generalizing Dirac equation by employing the Clifford algebra of the cubic polynomial associated to Klein-Gordon operator multiplied by the mass parameter. Unlike…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…