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 991 for “"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 …
-
Tiling the Integers
A set tiles the integers if and only if the integers can be written as a disjoint union of translates of that set. Counterexamples based on finite Abelian groups show that Fuglede conjecture is false in high dimensions. A solution for the Fuglede conjecture in Z or all the groups ZN would provide a …
-
The Factoradic Integers
… examined; this leads to the consideration of the integers as a metric space under the "factoradic metric", i.e., the integers equipped with a distance function defined by d(n,m)=1/N!, where N is the largest positive integer such that N! divides n-m. Via the process of metric completion, the …
-
The Set of Integers
This project was undertaken because there are few good texts available for low-ability mathematics students . Besides, in many of those that are available the language is such as to give the impression that negative numbers are merely positive numbers "with the sign changed". Some texts also seem …
-
The Set of Integers
This project was undertaken because there are few good texts available for low-ability mathematics students. Besides, in many of those that are available the language is such as to give the impression that negative numbers are merely positive numbers "with the sign changed". Some texts also seem to …
-
Asymptotic distribution of beurling integers /
… from them. The asymptotic distribution of g-integers is given with the assumption that g-prime counting function $\pi_\calP(x)$ behaves as \begin{align*} \pi_\calP(x)=\frac{bx}{\log x}+\bO(x^\alpha)\qquad(x\to +\infty) \end{align*} for some $b>0, \alpha\in(0,1)$.
-
NTRU over the Eisenstein Integers
… NTRU-like cryptosystem based on the Eisenstein integers. We discuss parameter selection and develop a model for the probabilty of decryption failure. We also provide an implementation of ETRU. We use theoretical and experimental data to compare the security and efficiency of ETRU to NTRU with …
-
Covering Sets of the Integers
Made available in DSpace on 2014-12-11T18:23:43Z (GMT). No. of bitstreams: 1 7121162.pdf: 3349128 bytes, checksum: ff4e647d59c04f1ac0287e0172b96651 (MD5) Previous issue date: 1971
-
Sums of distinct divisors of rational integers and sums of distinct divisors of quadratic integers
Thesis (Ph. D.)--Michigan State University of Agriculture and Applied Science. Dept. of Mathematics, 1956
-
Rings of finite rank over integers
We study the rings and ideal classes associated to weakly divisible polynomials and other homogeneous ideals in higher projective spaces ($\mathbb{P}^{k}(\overline{\mathbb{Q}})$). To a point, say, $$P=[1:\alpha_1:\cdots:\alpha_m]\in \mathbb{P}^{m}(\overline{\mathbb{Q}}),$$ we associate a ring …
-
The Solution of Equations in Integers
… are considered. The elementary properties of integers are assumed.
-
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 …
-
Adaptive Single-Pass Compression of Unbounded Integers
… used to test the algorithms’ ability to compress integers. The synthetic dataset is created using several probability distribution functions (PDF), such as geometric and Poisson. Meanwhile, the Wikipedia dataset is acquired from actual inverted indexes for a number of different Wikipedia search …
-
Composite numbers in the sequences of integers /
… is shown that there are infinitely many positive integers n such that ([ξ(5/4)^n]; 6006)>1, where 6006 = 2•3•7•11•13. Similar results are obtained for shifted powers of some other rational numbers. In particular, the same is proved for the sets of integers nearest to ξ(5/3)^n and to ξ(7/5)^n, …
-
A Discrete Pareto Distribution on Positive Integers
The Zipf's law is a standard discrete power-law probability distributions, often thought of as a discrete counterpart of the Pareto distribution. Here we study an alternative discrete Pareto distribution, using the general approach of discretizing a continuous distribution. We obtain several …
-
A sieve problem over the Gaussian integers
<p>Our 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 …
-
Sums of Divisors, Units and Algebraic Integers
Abstract not provided.
-
Generalized and restricted multiplication tables of integers
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-06-11T20:10:14Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Koukoulopoulos_Dimitrios.tex: 150989 bytes, checksum: 0478d1ce3b482241f0d7d6d6daf5dde5 (MD5) Koukoulopoulos_Dimitrios.pdf: …
Page 1 of 50