Related papers: Lower Bounds for Maximum Gap in (Inverse) Cyclotom…

We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…

We study the Galois groups $G_f$ of degree $2n$ reciprocal (a.k.a. palindromic) polynomials $f$ of height at most $H$, finding that $G_f$ falls short of the maximal possible group $S_2 \wr S_n$ for a proportion of all $f$ bounded above and…

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

This paper is devoted to a rigorous analysis of exponential convergence of polynomial interpolation and spectral differentiation based on the Gegenbauer-Gauss and Gegenbauer-Gauss-Lobatto points, when the underlying function is analytic on…

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $\pm 1$. The extremal polynomial $p_n^*$ is the polynomial that maximizes the uniform norm $\| p \|_{[-1,1]}$ among polynomials $p$ of degree $\leq…

This paper introduces a number of new techniques in the study of the famous question from numerical linear algebra: what is the largest possible growth factor when performing Gaussian elimination with complete pivoting? This question is…

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…

One field of particular interest in Number Theory concerns the gaps between consecutive primes. Within the last few years, very important results have been achieved on how small these gaps can be. The strongest of these results were…

Let $\Gamma$ be a $C^{2+}$ Jordan arc and let $\Gamma_0$ be the open arc which consists of interior points of $\Gamma$. We find concrete upper and lower bounds for the limit of Widom factors for $L_2(\mu)$ extremal polynomials on $\Gamma$…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

We provide finite sample upper and lower bounds on the Binomial tail probability which are a direct application of Sanov's theorem. We then use these to obtain high probability upper and lower bounds on the minimum of i.i.d. Binomial random…

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

We study the non-linear extension of integer programming with greatest common divisor constraints of the form $\gcd(f,g) \sim d$, where $f$ and $g$ are linear polynomials, $d$ is a positive integer, and $\sim$ is a relation among $\leq, =,…

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…