Related papers: $T$-adic exponential sums of polynomials in one va…

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

Let $p$ be a prime number. The $p$-power cyclic resultant of a polynomial is the determinant of the Sylvester matrix of $t^{p^n}-1$ and the polynomial. It is known that the sequence of $p$-power cyclic resultants and its non-$p$-parts…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

We study $p$-adic Euler's series $E_p(t) = \sum_{k=0}^{\infty}k!t^k$ at a point $p^a$, $a \in \mathbb{Z}_{\ge 1}$, and use Pad\'e approximations to prove a lower bound for the $p$-adic absolute value of the expression $cE_p\left(\pm…

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

Exponential tail bounds for sums play an important role in statistics, but the example of the $t$-statistic shows that the exponential tail decay may be lost when population parameters need to be estimated from the data. However, it turns…

We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

For a lattice polytope P, define A_P(t) as the sum of the solid angles of all the integer points in the dilate tP. Ehrhart and Macdonald proved that A_P(t) is a polynomial in the positive integer variable t. We study the numerator…

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…

We consider the generalized Thue-Morse sequences $(t_n^{(c)})_{n\ge 0}$ ($c \in [0,1)$ being a parameter) defined by $t_n^{(c)} = e^{2\pi i c s_2(n)}$, where $s_2(n)$ is the sum of digits of the binary expansion of $n$. For the polynomials…

We show that the number of real roots of random trigonometric polynomials with i.i.d. coefficients, which are either bounded or satisfy the logarithmic Sobolev inequality, satisfies an exponential concentration of measure.

An analogue of the Gauss-Lucas theorem for polynomials over the algebraic closure $\mathbb C_p$ of the field of $p$-adic numbers is considered.