Related papers: Sparse binary cyclotomic polynomials

We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…

Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to $r>1$ different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials,…

We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We give upper bounds on the size of the gap between a non-zero constant term and the next non-zero Fourier coefficient of an entire level two modular form. We give upper bounds for the minimum positive integer represented by a level two…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We prove upper bounds on the sum of Betti numbers of tropical prevarieties in dense and sparse settings. In the dense setting the bound is in terms of the volume of Minkowski sum of Newton polytopes of defining tropical polynomials, or,…

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…

For a nonempty compact set D of R we determine the maximal possible dimension of a subspace X of polynomial functions of degree at most m which possesses a positive bases (where positivity is understood on D). The exact value of this…

We use bounds of character sums and some combinatorial arguments to show the abundance of very smooth numbers which also have very few non-zero binary digits.

We prove that the zero set of a 4-nomial in n variables in the positive orthant has at most three connected components. This bound, which does not depend on the degree of the polynomial, not only improves the best previously known bound…

In this paper we investigate distribution of zeros for only quasipolynom and obtain exactly lower-bound for their modulus.

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…