Related papers: Trinomials with given roots
In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
Let $s \geq 3$ be a fixed positive integer and $a_1,\dots,a_s \in \mathbb{Z}$ be arbitrary. We show that, on average over $k$, the density of numbers represented by the degree $k$ diagonal form \[ a_1 x_1^k + \cdots + a_s x_s^k \] decays…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…
We give an asymptotic formula for the number of monic Eisenstein polynomials of odd prime degree satisfying an additional condition that arises in the study of the genus number of an algebraic number field.
In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…
For each integer $n\ge 2$, we identify new infinite families of monogenic trinomials $f(x)=x^n+Ax^m+B$ with non-squarefree discriminant, many of which have small Galois group. These families are thus different from many previous…
To a complex polynomial function $f$ with arbitrary singularities we associate the number of Morse points in a general linear Morsification $f_{t} := f - t\ell$. We produce computable algebraic formulas in terms of invariants of $f$ for the…
We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…
The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph…