Related papers: Tschirnhaus transformations after Hilbert

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

The problem of finding roots or solutions of a nonlinear partial differential equation may be formulated as the problem of minimizing a sum of squared residuals. One then defines an evolution equation so that in the asymptotic limit a…

Let $D$ be a negative integer congruent to $0$ or $1\bmod{4}$ and $\mathcal{O}=\mathcal{O}_D$ be the corresponding order of $ K=\mathbb{Q}(\sqrt{D})$. The Hilbert class polynomial $H_D(x)$ is the minimal polynomial of the $j$-invariant $…

According to the G\"ottsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials"…

Robin Hartshorne and Alexander Hirschowitz proved that a generic collection of lines on $\mathbb P^n$, $n \geq 3$, has bipolynomial Hilbert Function. We extended this result to a specialization of the collection of generic lines, by…

For every positive integer $n$, consider the linear operator $\U_{n}$ on polynomials of degree at most $d$ with integer coefficients defined as follows: if we write $\frac{h(t)}{(1 - t)^{d + 1}} = \sum_{m \geq 0} g(m) t^{m}$, for some…

This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…

Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Thanks to earlier work of Koiran, it is known that the truth of the Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomial-hierarchy. The truth of…

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >=…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

For any power series $a(t)$ with exponentially bounded nonnegative integer coefficients we suggest a simple construction of a finitely generated monomial associative algebra $R$ with Hilbert series $H(R,t)$ very close to $a(t)$. If $a(t)$…

In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…

Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…