Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSome remarks on Heath-Browns theorem on quadratic forms
144
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In his paper from 1996 on quadratic forms Heath-Brown developed a version of circle method to count points in the intersection of an unbounded quadric with a lattice of short period, if each point is given a weight. The weight function is assumed to be $C_0^infty$-smooth and to vanish near the singularity of the quadric. In out work we allow the weight function to be finitely smooth and not vanish near the singularity, and we give also an explicit dependence on the weight function.
rate research
Read More
Given a negative $D>-(log X)^{log 2-delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of discriminant $D$. We also give an analogous upper bound for square free integers of the form $q+a<X$ where $q$ is prime and $ainmathbb Z$ is fixed. Combined with the 1/2-dimensional sieve of Iwaniec, this yields a lower bound on the number of such integers $q+a<X$ represented by a binary quadratic form of discriminant $D$, where $D$ is allowed to grow with $X$ as above. An immediate consequence of this, coming from recent work of the authors in [BF], is a lower bound on the number of primes which come up as curvatures in a given primitive integer Apollonian circle packing.
In this article, we obtain an upper bound for the number of integral solutions, of given height, of system of two quadratic forms in five variables. Our bound is an improvement over the bound given by Henryk Iwaniec and Ritabrata Munshi in cite{H-R}.
We present a short, self-contained, and purely combinatorial proof of Linniks theorem: for any $varepsilon > 0$ there exists a constant $C_varepsilon$ such that for any $N$, there are at most $C_varepsilon$ primes $p leqslant N$ such that the least positive quadratic non-residue modulo $p$ exceeds $N^varepsilon$.
Let $p>3$ be a prime, and let $(frac{cdot}p)$ be the Legendre symbol. Let $binmathbb Z$ and $varepsilonin{pm 1}$. We mainly prove that $$left|left{N_p(a,b): 1<a<p text{and} left(frac apright)=varepsilonright}right|=frac{3-(frac{-1}p)}2,$$ where $N_p(a,b)$ is the number of positive integers $x<p/2$ with ${x^2+b}_p>{ax^2+b}_p$, and ${m}_p$ with $minmathbb{Z}$ is the least nonnegative residue of $m$ modulo $p$.
We discuss the Krein--von Neumann extensions of three Laplacian-type operators -- on discrete graphs, quantum graphs, and domains. In passing we present a class of one-dimensional elliptic operators such that for any $nin mathbb N$ infinitely many elements of the class have $n$-dimensional null space.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
