Related papers: On Wirsing's problem in small exact degree

We consider polynomials of degree $d$ with only real roots and a fixed value of discriminant, and study the problem of minimizing the absolute value of polynomials at a fixed point off the real line. There are two explicit families of…

Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

We establish an effective improvement on the Liouville inequality for approximation to complex non-real algebraic numbers by quadratic complex algebraic numbers.

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

We refer to the distance between optimal solutions of integer programs and their linear relaxations as proximity. In 2018, Eisenbrand and Weismantel proved that proximity is independent of the dimension for programs in standard form. We…

We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…

We establish a criterion for a complex number to be algebraic over Q of degree at most two. It requires that, for any sufficiently large real number X, there exists a non-zero polynomial with integral coefficients, of degree at most two and…