Related papers: The number of integer points close to a polynomial

We obtain the exact value of the Hausdorff dimension of the set of coefficients of Gauss sums which for a given $\alpha \in (1/2,1)$ achieve the order at least $N^{\alpha}$ for infinitely many sum lengths $N$. For Weyl sums with polynomials…

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Let $P(z)$ be a polynomial of degree $n$ having no zero in $|z|<k$ where $k\geq 1,$ then for every real or complex number $\alpha$ with $|\alpha|\geq 1$ it is known \begin{equation*} \underset{|z|=1}{\max}|D_\alpha P(z)|\leq…

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…

The independent set polynomial is important in many areas. For every integer $\Delta\geq 2$, the Shearer threshold is the value $\lambda^*(\Delta)=(\Delta-1)^{\Delta-1}/\Delta^{\Delta}$ . It is known that for $\lambda < -…

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

We consider radially symmetric solutions for a class of resonant problems on a unit ball $B \subset R^n$ around the origin \[ \Delta u+\la _1 u +g(u)=f(r) \s \mbox{for $x \in B$}, \s u=0 \s \mbox{on $\partial B$} \,. \] Here the function…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…

This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$, $\theta(x) > 0.9x,$ in the context of the $3n+1$ problem.

This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…

We prove a sharp upper bound on the number of integer solutions of the Parsell-Vinogradov system in every dimension $d\ge 2$.

In 1969, H. Davenport and W. M. Schmidt studied the problem of approximation to a real number \xi by algebraic integers of degree at most three. They did so, using geometry of numbers, by resorting to the dual problem of finding…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…