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 7 of 7 for “"Gaussian primes"”.

  1. A sieve problem over the Gaussian integers

    … main result is that there are infinitely many primes of the form a² + b² such that a² + 4b² has at most 5 prime factors.</p><p>We prove this by first developing the theory of $L$-functions for Gaussian primes by using standard methods. We then give an exposition of the Siegel--Walfisz Theorem …

    oxford Repository record for A sieve problem over the Gaussian integers (opens in a new tab)

  2. Improving averages over the prime numbers and Goldbach's conjecture

    … techniques interact in the study of primes and other arithmetic structures. We begin by studying averaging operators along prime numbers in arithmetic progressions. We establish uniform $\ell^r$-improving and maximal inequalities for these averages, with bounds independent of the …

    gatech Repository record for Improving averages over the prime numbers and Goldbach's conjecture (opens in a new tab)

  3. Improving and maximal inequalities in discrete harmonic analysis

    … \in (1,2)$. We move on to study averages along primes in arithmetic progressions. Let $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of step $ y$, \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv b\mod{y}}} \Lambda …

    gatech Repository record for Improving and maximal inequalities in discrete harmonic analysis (opens in a new tab)

  4. Components of the Emerton-Gee Moduli Stack of Galois Representations for GL2 and A Graph-Theoretic Approach to Computing Selmer Groups of Elliptic Curves over Q(i)

    … curve E_b, whose vertices correspond to the odd Gaussian primes dividing b. The weights on the edges connecting these vertices are determined by the quartic residue symbols between these primes. We then establish a bijection between the elements of the φ-Selmer group of E_b and certain partitions …

    rice Repository record for Components of the Emerton-Gee Moduli Stack of Galois Representations for GL2 and A Graph-Theoretic Approach to Computing Selmer Groups of Elliptic Curves over Q(i) (opens in a new tab)

  5. An Exposition of the Eisenstein Integers

    … in the complex plane, in contrast with the Gaussian integers, ℤ[i] = {a + bi ∣ a, b ∈ ℤ} which form a square lattice in the complex plane. The Gaussian moat problem, first posed by Basil Gordon in 1962 at the International Congress of Mathematicians in Stockholm [7], asks whether it is …

    eiu Repository record for An Exposition of the Eisenstein Integers (opens in a new tab)

  6. Instruction systolic arrays for exact parallel linear algebraic computation

    … COMPLEX RATIONAL AND MATRIX ARITHMETIC USING GAUSSIAN PRIME CODES In this chapter, we introduce a new parallel exact complex rational arithmetic system based on Gaussian prime codes. Two closely related methods for constructing these codes are described. The first method uses several distinct …

    waikato-masters Repository record for Instruction systolic arrays for exact parallel linear algebraic computation (opens in a new tab) Download file for Instruction systolic arrays for exact parallel linear algebraic computation (opens in a new tab)

  7. Topics in analytic number theory

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2026-02-19 without embargo terms

    uiuc Repository record for Topics in analytic number theory (opens in a new tab)