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 18 of 18 for “"Gaussian Integers"”.
-
A sieve problem over the Gaussian integers
… first developing the theory of $L$-functions for Gaussian primes by using standard methods. We then give an exposition of the Siegel--Walfisz Theorem for Gaussian primes and a corresponding Prime Number Theorem for Gaussian Arithmetic Progressions.</p><p>Finally, we prove the main result by using …
-
Security systems based on Gaussian integers : Analysis of basic operations and time complexity of secret transformations
… on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common security protocols with Gaussian integers. Although the main contribution of this work is to …
-
Gaussian Amicable Pairs
Amicable pairs are two integers where the sum of the proper divisors of one is the other and vice versa. Since the Gaussian integers have many of the properties of the regular integers, we sought to discover whether there exist any pairs of Gaussian integers with the same property. It turns out …
-
On The Dynamical, Geometric, And Arithmetic Properties Of Euclidean Lattices
… algebraic structure of the quaternions and the Gaussian integers.
-
Density of direct factors in normed arithmetical semi-groups.
… in addition to the semi-group N* of positive integers, analogous "normalized" semi-groups of Gaussian integers and other algebraic integers.
-
Algebraic Integers
… give a substantial generalization of the set of integers Z, where particular emphasis is given to number theoretic questions such as that of unique factorization. The origin of the thesis came from a study of a special case of generalized integers called the Gaussian Integers, namely the set of …
-
Lattice-based cryptosystems
… which follows the idea of CTRU and NTRU over Gaussian integers, implies one may extend the NTRU encryption scheme over integral domains up to some constraints. We give details for realizing such extensions over Euclidean domains and denote by ETRU the corresponding class of cryptosystems.
-
Lattice of Maximal-Primary Ideals in Quadratic Orders
An order is a subring of the ring of integers of an algebraic extension, Peruginelli and Zanardo classified the lattices of orders with prime index inside te ring of integers of quadratic extensions of the rational numbers. The lattices are quite striking and have different layered structure …
-
Kompleksinės skaičiavimo sistemos ir fraktaliniai išklojimai /
… various examples where the lattice is made of Gaussian integers and Eisenstein numbers.
-
The Distribution of Primitive Roots in Fields of Order P²
… usual mathematical meaning, will denote rational integers where we let Z represent the set of all rational integers. We call µ = a + bi a Gaussian integer iff a and b are rational integers and we denote the set of all Gaussian integers by Z(i). The set of Gaussian integers can be represented …
-
An Exposition of the Eisenstein Integers
… understand how the imaginary ring of quadratic integers behaves. An example of said ring are complex numbers of the form ℤ[ω] = {a+bω ∣ a, b ∈ ℤ} where ω2 + ω + 1 = 0. These are known as the Eisenstein integers, which form a triangular lattice in the complex plane, in contrast with the Gaussian …
-
Moments of distances between centres of Ford spheres
… of the mediant operation can be used to generate Gaussian rationals analogously to the Stern-Brocot tree construction for Farey fractions and (ii) that two Ford spheres may be considered ‘consecutive’ for some order S if they are tangent and there is some Ford sphere with radius greater than …
-
The Prouhet-Tarry-Escott problem
… find ideal solutions to the PTE problem in the Gaussian integers. We also extend a computation from the literature and find new lower bounds for the constant C_n associated to ideal PTE solutions. Further, we present a new algorithm that determines whether an ideal PTE solution with a particular …
-
Gaussian Pythagorean Triples
For positive integers a, b, c, we call the ordered triple (a, b, c) a Pythagorean triple provided a2 + b2 + c2. A Pythagorean triple is said to be primitive if a and b are relatively prime. It is a well-known fact that a primitive Pythagorean triple (a, b, c) in which a is even can be represented …
-
Metric Diophantine approximation on manifolds by algebraic points
… on a circle in the complex plane by ratios of Gaussian integers, which is motivated by recent advances in the theory of Wireless Communications. Then, in Chapter 4 we prove some partial results towards a Hausdorff measure description of the set of real numbers close to the zeros of polynomials …
-
Improving and maximal inequalities in discrete harmonic analysis
… We start by looking at averages along the integers using the divisor function $d(n)$ as defined in \eqref{eq-defin-divisor}: \begin{equation*} K_N f (x) = \frac{1}{D(N)} \sum _{n \leq N} d(n) \,f(x+n) , \end{equation*} where $D(N) = \sum _{n=1} ^N d(n) $. We obtain a uniform, scale free …
-
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