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 13 of 13 for “"Probabilistic number theory"”.
-
Topics in probabilistic number theory
… three distinct problems on the interface of number theory and random matrix theory. First, we compute the average of two shifted squares of the Riemann zeta on the critical line with shifts up to size T 6/5−ε. We give an explicit expression for such averages as well as the (2, 2)-moment of …
-
Topics in Multiplicative and Probabilistic Number Theory
A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneously be additively and multiplicatively structured. The practical verification of this heuristic is the source of a great number of difficult problems, including the well-known Hardy-Littlewood tuples …
-
Topics in Analytic, Combinatorial and Probabilistic Number Theory
In the last chapter we consider the problem of determining how large an integer M should be so that almost every subset of {l, ..., N} of size M contains at least one arithmetic progression of length k. We also investigate the length of the longest arithmetic progression in a random subset of …
-
Distribution of additive functions in algebraic number fields
… thesis is based on ideas drawn from classical probabilistic number theory, from the work of Novoselov [2], and from the relevant work on algebraic number fields. Classical probabilistic number theory (as described in Elliott [1], for example) is concerned with the distribution of arithmetic …
-
Effective variance estimates of additive functions defined on random combinatorial objects /
… multisets. It extends classical ideas of probabilistic number theory associated with the Turán–Kubilius inequality to random combinatorial structures. For permutations, sharp upper and lower variance bounds for strongly additive functions are obtained together with refined remainder …
-
ON THE DISTRIBUTION OF THE NUMBER OF PRIME FACTORS OF AN INTEGER
The distribution of the prime numbers has intrigued number theorists for centuries. As our understanding of this distribution has evolved, so too have our methods of analyzing the related arithmetic functions. If we let ω(n) denote the number of distinct prime divisors of a natural number n, then …
-
Moments of additive functions defined on random assemblies /
… mathematical problems, we used combinatorial, probabilistic and analytical methods. The technical approaches applied in probabilistic number theory are adopted and further enriched.
-
Adityviųjų funkcijų, apibrėžtų atsitiktinių ansamblių aibėje, momentai /
… mathematical problems, we used combinatorial, probabilistic and analytical methods. The technical approaches applied in probabilistic number theory are adopted and further enriched.
-
Normal Order of Certain Arithmetic Functions and New Analogues of the Erd\H{o}s-Kac Theorem
In 1917, Hardy and Ramanujan planted the seeds of Probabilistic Number Theory when they defined `normal order' of an arithmetic function. This was nurtured further by Erd\H{o}s and Kac and many other great minds who infused further improvements to the probabilistic theory of additive functions. A …
-
On multiplicative chaos in number theory
This thesis explores the interplay between number theory and multiplicative chaos. <br><br>The first chapter provides an overview of this connection and of our results. After introducing the notions of a logarithmically correlated field and Gaussian multiplicative chaos (GMC), we explain how they …
-
An Interpolating Regime for the Extreme Values of a Random Zeta Model
We study the large values of a random model of the Riemann zeta function over short intervals. The extreme value statistics depend on the interval size: the log-correlated regime governs intervals of order one while the i.i.d. regime emerges over longer intervals. The main focus is to describe the …
-
Some Sampling Designs and Estimation Problems
… from a continuous universe. In concert with the theory initiated by professor Douglas Robson (personal communication) and later presented by Cordy (1993), we consider design-based variance estimation for probability sampling from a continuous and spatially distributed universe. Using this theory …
-
Probabilistic analysis of ground strength variability on the stability of surface and underground excavations
Includes bibliographical references (pages 97-100).