English
Related papers

Related papers: Coefficients of squares of Newman polynomials

200 papers

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

Number Theory · Mathematics 2015-08-24 John Abbott

A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…

Representation Theory · Mathematics 2012-01-31 Uffe Haagerup , Henrik Schlichtkrull

Polynomials with coefficients in $\{-1,1\}$ are called Littlewood polynomials. Using special properties of the Rudin-Shapiro polynomials and classical results in approximation theory such as Jackson's Theorem, de la Vall\'ee Poussin sums,…

Classical Analysis and ODEs · Mathematics 2020-07-09 Tamás Erdélyi

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…

Algebraic Geometry · Mathematics 2019-07-02 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers

For nonempty subsets $S_0, \dots, S_{n-1}$ of a (large enough) finite field $\mathbb{F}$ satisfying $$|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1,$$ we show that there exist $a_0 \in S_0, \dots, a_{n-1} \in…

Number Theory · Mathematics 2017-07-21 Amotz Oppenheim , Mark Shusterman

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

Computational Complexity · Computer Science 2019-02-21 Albert Atserias , Tuomas Hakoniemi

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

Number Theory · Mathematics 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

Koiran's real $\tau$-conjecture claims that the number of real zeros of a structured polynomial given as a sum of $m$ products of $k$ real sparse polynomials, each with at most $t$ monomials, is bounded by a polynomial in $m,k,t$. This…

Computational Complexity · Computer Science 2021-07-30 Irénée Briquel , Peter Bürgisser

In a previous paper, we introduced the Collatz polynomials $P_N(z)$, whose coefficients are the terms of the Collatz sequence of the positive integer $N$. Our work in this paper expands on our previous results, using the Enestr\"om-Kakeya…

Complex Variables · Mathematics 2022-01-24 Matt Hohertz

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

Number Theory · Mathematics 2010-11-09 Martín Avendaño , Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

Probability · Mathematics 2020-10-12 Sean O'Rourke , Tulasi Ram Reddy

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

Classical Analysis and ODEs · Mathematics 2023-05-04 German Dzyubenko , Kirill A. Kopotun

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

We prove that several forms of the Bernstein polynomials with integer coefficients possess the property of simultaneous approximation, that is, they approximate not only the function but also its derivatives. We establish direct estimates…

Classical Analysis and ODEs · Mathematics 2019-04-23 Borislav R. Draganov

It is shown that for polynomials $p_1, p_2 \in {\mathbb Z}[t]$ with ${\rm deg}\ p_1, {\rm deg}\ p_2\ge 5$ there exist a probability space $(X,{\mathcal X},\mu)$, two ergodic measure preserving transformations $T,S$ acting on $(X,{\mathcal…

Dynamical Systems · Mathematics 2023-12-12 Wen Huang , Song Shao , Xiangdong Ye

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

Combinatorics · Mathematics 2013-07-05 Robert P. Boyer , William J. Keith

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

Number Theory · Mathematics 2021-08-30 Vivian Kuperberg
‹ Prev 1 4 5 6 7 8 10 Next ›