Related papers: Points on polynomial curves in small boxes modulo …

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Moduli spaces of semi-stable real and quaternionic vector bundles of a fixed topological type admit a presentation as Lagrangian quotients, and can be embedded into the symplectic quotient corresponding to the moduli variety of semi-stable…

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

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…

Using the recent result of Bourgain, Demeter and Guth on Vinogradov's mean value, a number of new results about small fractional parts of polynomials and fractional parts of additive forms are obtained. These improve work of Baker, Cook,…

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

In this paper, we study the prescribed $Q$-curvature problem on closed four-dimensional Riemannian manifolds when the total integral of the $Q$-curvature is a positive integer multiple of the one of the four-dimensional round sphere. This…

We show how to define and count lattice points in the moduli space $\modm_{g,n}$ of genus g curves with n labeled points. This produces a polynomial with coefficients that include the Euler characteristic of the moduli space, and…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Let $Q(x,y,z)$ be an integral quadratic form with determinant coprime to some modulus $q$. We show that $q\mid Q$ for some non-zero integer vector $(x,y,z)$ of length $O(q^{5/8+\varepsilon})$, for any fixed $\varepsilon>0$. Without the…

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…