Distribution of squares modulo a composite number

We give a short alternative proof using Heath-Brown's square sieve of a bound of the author for the large sieve with square moduli.

This paper deals with function field analogues of the famous theorem of Landau which gives the asymptotic density of sums of two squares in $\mathbb{Z}$. We define the analogue of a sum of two squares in $\mathbb{F}_q[T]$ and estimate the number $B_q(n)$ of such polynomials of degree $n$ in two cases. The first case is when $q$ is large and $n$ fixed and the second case is when $n$ is large and $q$ is fixed. Although the methods used and main terms computed in each of the t...

Factorisation of integers $n$ is of number theoretic and cryptographic significance. The Number Field Sieve (NFS) introduced circa 1990, is still the state of the art algorithm, but no rigorous proof that it halts or generates relationships is known. We propose and analyse an explicitly randomised variant. For each $n$, we show that these randomised variants of the NFS and Coppersmith's multiple polynomial sieve find congruences of squares in expected times matching the best-...

In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.

Consider the number of integers in a short interval that can be represented as a sum of two squares. What is an estimate for the variance of these counts over random short intervals? We resolve a function field variant of this problem in the large $q$ limit, finding a connection to the $z$-measures first investigated in the context of harmonic analysis on the infinite symmetric group. A similar connection to $z$-measures is established for sums over short intervals of the div...

In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.

We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.

We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the discriminant polynomials of various prehomogeneous and coregular representations where generic stabilizers are finite. This has applications to a number of arithmetic distribution questions, e.g., to the density of small degree number fields having ...

This paper is concerned with squarefree values of polynomials and their density in large boxes centered at the origin.

We consider the uniform distribution of solutions $(x,y)$ to $xy=N \mod a$, and obtain a bound on the second moment of the number of solutions in squares of length approximately $a^{1/2}$. We use this to study a new factoring algorithm that factors $N=UV$ provably in $O(N^{1/3+\epsilon})$ time, and discuss the potential for improving the runtime to sub-exponential.