Related papers: Lower Bounds by Birkhoff Interpolation

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

We consider a specific scheme of multivariate Birkhoff polynomial interpolation. Our samples are derivatives of various orders $k_j$ at fixed points $v_j$ along fixed straight lines through $v_j$ in directions $u_j$, under the following…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

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…

We improve Mahler's lower bound for the Mahler measure in terms of the discriminant and degree for a specific class of polynomials: complex monic polynomials of degree $d\geq 2$ such that all roots with modulus greater than some fixed value…

We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…

Interpolation inequalities for $C^m$ functions allow to bound derivatives of intermediate order $0 < j<m$ by bounds for the derivatives of order $0$ and $m$. We review various interpolation inequalities for $L^p$-norms ($1 \le p \le…

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

In a previous paper, the authors determined, among other things, the main terms for the one-level densities for low-lying zeros of symmetric power L-functions in the level aspect. In this paper, the lower order terms of these one-level…

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…