Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"the circle method"”.
-
Application of The Circle Method in Five Number Theory Problems
This thesis consists of three applications of the circle method in number theory problems. In the first chapter, we study a question of Graham. Are there infinitely many integers $n$ for which the central binomial coefficient $\binom{2n}{n}$ is relatively prime to $105 = 3\cdot 5 \cdot 7$? By …
-
On the Limitations and Restrictions of the Hardy-Littlewood Circle Method
We discuss herein the history, layout, and philosophy of the Hardy-Littlewood Circle method, as well as the more modern renditions thereof. The limitations and scope of each method presented is discussed in detail, providing examples of cases where the failure of the circle method is of relevance. …
-
A quantitative approach to Szemeredi's theorem using Heisenberg nilmanifolds
In this thesis we study the problem of finding length four arithmetic progressions in subsets in the integers via the use of Heisenberg nilmanifolds. Our goal is to generalise the circle method used by Bourgain to study length three arithmetic progressions to length four arithmetic progressions by …
-
Partitions into Sums of Two Squares and Gaps Between Zeros of L-Functions
This work consists of two distinct problems. In the first one, we use a variation of the Circle Method, along with ideas coming from the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. In the second …
-
Rational points in function fields
A function field version of the circle method is applied to a cubic hypersurface X defined over a finite field Fq. Using the correspondence between Fq-rational curves and Fq(t)-points, we deduce the dimension and irreducibility of the moduli space of rational curves on X passing through two fixed …
-
A Partition Function Connected with the Göllnitz-Gordon Identities
Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to …
-
Asymptotic Formulae for Restricted Unimodal Sequences
Additive enumeration problems, such as counting the number of integer partitions, lie at the intersection of various branches of mathematics including combinatorics, number theory, and analysis. Extending partitions to integer unimodal sequences has also yielded interesting combinatorial results …
-
Asymptotic Estimates for Rational Spaces on Hypersurfaces in Function Fields
The ring of polynomials over a finite field has many arithmetic properties similar to those of the ring of rational integers. In this thesis, we apply the Hardy-Littlewood circle method to investigate the density of rational points on certain algebraic varieties in function fields. The aim is to …
-
A multidimensional Szemerédi's theorem in the primes
In this thesis, we investigate topics related to the Green-Tao theorem on arithmetic progression in primes in higher dimensions. Our main tool is the pseudorandom measure majorizing primes defined in [51] concentrated on almost primes. In chapter 2, we combine the sieve technique used in …
-
Secondary Terms in Asymptotics for the Number of Zeros of Quadratic Forms
… form on an $n$-dimensional vector space $V$ over the rational numbers, and let $J$ be the symmetric matrix associated to $F$. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size $B$. Heath-Brown gave an asymptotic for …
-
THE GOLDBACH-LINNIK PROBLEM: SOME CONDITIONAL RESULTS
This work concerns the Goldbach-Linnik problem, which is a variation of Goldbach's one: here the goal is to prove that all large even integers can be written as a sum of two primes and k powers of 2, where k is a fixed positive integer. Assuming the Generalized Riemann Hypothesis, first we prove …
-
Systems of forms in many variables
… to be solved in integers. By applying the circle method, when the number of variables is large and the system is geometrically well-behaved we give an asymptotic estimate for the number of solutions of bounded size.</p> <p>In the case of <em>R</em> homogeneous equations having the same …
-
Waring's problem in thin sets and mixed moments of the Riemann Zeta function
This thesis is devoted to two topics in Analytic number theory, namely, that of Waring type problems in thin sets and mixed moments of the Riemann zeta function. <br/><br/>We begin by examining the expected asymptotic formula of the representation function in Waring’s problem over sums of three …
-
On additive problems involving shifted integers and ellipsephic sets
In this thesis, we present a series of results concerning the number of solutions to equations and inequalities involving sums of perfect powers. In order to count such solutions, we use variants of the Hardy–Littlewood circle method, a versatile technique whose history is outlined in Chapter 1. …