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 20 of 67 for “"arithmetic progressions"”.
-
Dirichlet's Theorem on Arithmetic Progressions
… is to give a proof of Dirichlet's Theorem on Arithmetic Progressions, provide a brief history of the area, explain the mathematical concepts used in the theorem, and to expound upon the significance of the theorem. The statement of the Theorem is as follows: Given two coprime integers k and n, …
-
Erdős-Deep Families of Arithmetic Progressions
… of: $\{0,1,2,4\}$ when $n = 6$; and, modular arithmetic progressions $\{0,g,2g,\cdots,(k-1)g\} \subseteq \Z_n$ for some generator $g$ and size $k$. Erd\H{o}s-deep sets have primarily been considered in metric spaces $(\Z_n,\delta)$ and $(\R^d,\norm{\cdot})$ for $d = 2$, but some exploration …
-
On Arithmetic Progressions and Perfect Powers
… the problems that occur at the intersection of arithmetic progressions and perfect powers. In particular we will study the Erd˝os-Selfridge curves, By^l = x(x + d). . .(x + (k − 1)d), and sums of powers of arithmetic progressions, in particular y ^l = (x−d)^3+x^3+ (x+d)^3 . We shall study these …
-
Covering the integers with arithmetic progressions / by R.J. Simpson
Bibliography: leaves 121-123
-
Explicit Estimates for Functions of Primes in Arithmetic Progressions
… the error term in the prime number theorem for arithmetic progressions, and Waring's problem for cubes.
-
A Detailed Proof of the Prime Number Theorem for Arithmetic Progressions
… in 1998 to prove the Prime Number Theorem for arithmetic progressions. We will review basic results from Dirichlet characters and L-functions. Furthermore, we establish a weak version of the Wiener-Ikehara Tauberian Theorem, which is an essential tool for the proof of our main result.
-
On a problem of Schinzel concerning principal divisions in arithmetic progressions
Thesis (Ph.D.)--Michigan State University. Department of Mathematics, 1970
-
Forward Limit Sets of Semigroups of Substitutions and Arithmetic Progressions in Automatic Sequences
… the maximum length A(d) of the monochromatic arithmetic progressions of difference d appearing in these sequences. For example, for the Thue-Morse sequence and a class of generalised Thue-Morse sequences, we give exact values of A(d) or upper bounds on it, for certain differences d. For …
-
A quantitative approach to Szemeredi's theorem using Heisenberg nilmanifolds
… 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 replacing …
-
Explorations in Elementary and Analytic Number Theory
… is dedicated its own chapter. First, we consider arithmetic progressions in the polygonal numbers with a fixed number of sides. We will show that four-term arithmetic progressions cannot exist. We then describe explicitly how to find all three-term arithmetic progressions. Additionally we show …
-
Real Algebraic Geometry in Additive Number Theory
… we set up a novel machinery for counting arithmetic progressions using real algebraic geometry. We prove several new results related to Szemerédi's theorem. We prove results for arithmetic progressions of length 3 that one has not been able to prove using Fourier analytic methods or …
-
Two special cases of the Dynamical Mordell-Lang Conjecture in positive characteristic
… n ∈ ℕ double : φ^n(α) ∈ V } is a finite union of arithmetic progressions. When the dimension k = 3, we show S is a finite union of arithmetic progressions for any group endomorphism φ.
-
Automatic sequences from algebraic, dynamical, and computational perspectives
… the lengths of the longest monochromatic arithmetic progressions for a fixed difference in Sturmian sequences. We provide a complete classification for their lengths using a simple set of formulae. Our strongest results are proved using methods from dynamical systems, especially the …
-
On coverings and reduced residues in combinatorial number theory
… the distribution of prime numbers among arithmetic progressions. If \(P_r\) denotes the product of the first \(r\) prime numbers, then a conjecture of Montgomery states that \(j(P_r)\) can be bounded from above by \(r (\log r)^2\) up to some constant factor. However, the until now very …
-
Variations on a theorem by van der Waerden
… in this thesis is van der Waerden's theorem on arithmetic progressions. Van der Waerden's theorem guarantees that for any integers k and r, there is an n so that however the set {1, 2, ... , n} is split into r disjoint partition classes, at least one partition class will contain a k-term …
-
Arithmetic structures in random sets
… Sarkozy's theorem and a theorem of Green on long arithmetic progressions in sumsets to dense subsets of random sets with asymptotic density 0. Our proofs require a transference argument due to Green and Green-Tao which enables us to apply known results for sets of positive upper density to subsets …
-
Arithmetic Biases for Binary Quadratic Forms
The prime number theorem for arithmetic progressions tells us that there are asymptotically as many primes congruent to $1 \bmod 4$ as there are congruent to $3 \bmod 4$. That being said, Chebyshev noticed that (numerically) there almost always seems to be slightly more primes congruent to $3$. …
-
Combinatorics using computational methods
… cannot be r-colored while avoiding monochromatic arithmetic progressions. Finding the minimum n with this property is an incredibly difficult problem. We develop methods to compute the minimum n as well as optimal colorings when trying to avoid two generalizations of arithmetic progressions. …
-
Quadratic Reciprocity: Proofs and Applications
… cases of Dirichlet's theorem on primes in arithmetic progressions and Fermat's theorem on sums of two squares.
Page 1 of 4