相关论文: On bilinear sums with modular square roots and app…
We obtain the exponent of distribution $1/2+1/30$ for the ternary divisor function $d_3$ to square-free and prime power moduli, improving the previous results of Fouvry--Kowalski--Michel, Heath-Brown, and Friedlander--Iwaniec. The key input…
It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are…
In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…
We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…
A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…
The main goal of this expository article is to survey recent progress on the arithmetic Siegel-Weil formula and its applications. We begin with the classical sum of two squares problem and put it in the context of the Siegel-Weil formula.…
We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time's spending. Further, both of…
We extend the scope of a former paper to vector bundle problems involving more than one vector bundle. As the main application, we obtain the solution of the well-known moduli problems of vector bundles associated with general quivers.
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
We prove a large sieve inequality for square norm moduli in Z[i].
We show that sums of the SL(3,Z) long element Kloosterman sum against a smooth weight function have cancellation due to the variation in argument of the Kloosterman sums, when each modulus is at least the square root of the other. Our main…
Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method…
Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…
We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…
We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…
We address the problem of the determination of the images of three-dimensional geometric and modular Galois representations. In the modular case the existence of these representations is only conjectural. We give conditions to ensure that…
We examine a family of three-dimensional exponential sums with monomials and provide estimates which are in some instances sharper than those stemming from approaches entailing the use of existing bounds pertaining to analogous sums.