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 22 for “"Multiplicative functions"”.
-
Random Multiplicative Functions
For X(n) a Steinhaus random multiplicative function, and f(n) an integer poly-<br/>nomial, we consider the random polynomials<br/>P_{N,f}(θ) = (1/√N) ∑_{n≤N} X(n)e(f(n)θ)<br/>and show that 2k-th moments on the unit circle tend to Gaussian moments in the<br/>sense of mean-square convergence, …
-
Additive and Multiplicative Functions
No abstract prepared.
-
Correlations of multiplicative functions and factoring algorithms
… number theory, with a particular focus on multiplicative functions. A fundamental example is the Liouville function $\lambda : \mathbb{N} \to \{\pm 1\}$, which satisfies $\lambda(p)=-1$ for every prime $p$ and is conjectured to behave pseudorandomly in many respects.<br><br>Our first result …
-
On arithmetics in Cayley's algebra and multiplicative functions
… of Cayley's algebra C and to define certain multiplicative functions by summing homogeneous polynomials in four (or eight) indeterminates over the components of all elements of constant norm m of an arithmetic of C. The algebra C is introduced by reviewing some of the relevant work by Cayley, …
-
Relationships Between the Integrals of Additive and Multiplicative Functions
No abstract prepared.
-
Topics in the Theory of Q-Additive and Q-Multiplicative Functions
In Part III, we present some numerical data on the joint distribution problem studied in Part II. The calculations were performed using the MATHEMATICA software program.
-
Sums of Multiplicative Functions Over Integers Without Large Prime Factors and Related Differential Difference Equations
… in various areas of number theory. Counting functions of such integers have been the subject of numerous past studies. Traditionally, Psi(x, y) denotes the number of positive integers up to x, all of whose prime divisors are less than or equal to y. The estimate of Psi(x, y) is given in terms …
-
Topics in Multiplicative and Probabilistic Number Theory
… 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 conjecture. Conjectures of this type are also at least morally …
-
Topics in Analytic Number Theory
… we study the coefficients of automorphic L-functions induced by various automorphic forms. Due to the generalized Ramanujan-Petersson conjecture, these coefficients are characterized by divisor-bounded and multiplicative properties. To investigate these coefficients, we employ techniques …
-
On the theory of integer sequences
… from a Beatty sequence and properties of certain multiplicative functions on a Beatty sequence. We move on to the Robin and Nicolas inequalities and consider sequences with certain properties which must satisfy these. Next is we explore certain sequences of composite integers which are similar to …
-
Character Studies: Investigating the Limiting Distribution of Character Sums
… series with Steinhaus and Rademacher random multiplicative functions as the respective Fourier coefficients.
-
Asymptotic formulae for arithmetic functions
… concerning the asymptotic nature of arithmetic functions. First, we conduct a finer analysis on the behavior of λ(Euler's totient function(n)) in relation to λ(λ(n)), proving that log(λ(Euler's totient function(n))/λ(λ(n))) is asymptotic to (log log n)(log log log n)for almost all n. Second, we …
-
Structure and randomness in arithmetic settings
… behaviour. In the setting of arithmetic functions, we establish mild conditions under which the tuple of multiplicative functions [f₁, f₂, …, f_d ], evaluated at d consecutive integers n+1, …, n+d, closely approximates points in R^d for a positive proportion of n; we obtain a further …
-
Topics in explicit number theory
… of the Riemann zeta function and Dedekind zeta functions, which improve previous results of Trudgian. This improvement is based on ideas from previous works of Bennett et al., Kadiri and Ng and Trudgian. This is a joint work with Quanli Shen and Peng-Jie Wong. In Chapter 4, we apply explicit …
-
Brands of cumulants in non-commutative probability, and relations between them
… NC and put into evidence a certain group of semi-multiplicative functions, which encapsulate the moment-cumulant formulas and the inter-cumulant transition formulas for several known brands of cumulants in non-commutative probability. I next extend my considerations to the framework of P, which …
-
Escape of mass on Hilbert modular varieties
… these identities, we introduce mock P-Hecke multiplicative functions and bound a key related growth measure following Soundararajan’s paper. Finally, amassing our results, we eliminate the possibility of escape of mass for Hecke-Maass cusp forms on M.
-
On multiplicative chaos in number theory
… 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 arise in the …
-
Santrauka /
… distributions of completely additive functions values defined on a symmetric group with respect to Ewens probability measure, if the group order unbounded increases. Power and factorial moments formulae of additive functions are derived. There are established necessary and sufficient …
-
Santrauka /
… distributions of completely additive functions values defined on a symmetric group with respect to Ewens probability measure, if the group order unbounded increases. Power and factorial moments formulae of additive functions are derived. There are established necessary and sufficient …
-
Neural Question Answering Systems: The Roles of Attention and Recurrent Neural Networks
… QA model. Many different attention similarity functions and relevant information generation methods have been used by various neural QA systems. It is important to understand the characteristics of the similarity functions and the relevant information generation approaches that perform well. In …
Page 1 of 2