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 36 for “"Counting Function"”.
-
Analytic Computation of the Prime -Counting Function
… In this dissertation we: (1) introduce a kernel function which appears to be more effective than the one suggested by Lagarias and Odlyzko; (2) perform a careful analysis of various sources of truncation error; (3) give choices of parameters which bound the truncation error while keeping …
-
A Nevanlinna-Type Counting Function and Pullback Measure
… dissertation, we introduce a Nevanlinna-type counting function, $M_{\varphi, \alpha}$. We show that $M_{\varphi, \alpha}$ is subharmonic and continuous on $\theset$ by exhibiting certain properties of the logarithmic potential of the associated pullback measure of two-dimensional Lebesgue …
-
Mean Eigenvalue Counting Function Bound for Laplacians on Random Networks
… of random graphs and show that the eigenvalue counting function of Laplacians on these graphs has exponential decay bound. Since our methods heavily depend on the first nonzero eigenvalue of Laplacian, we study also this eigenvalue for the graph in both random and nonrandom cases.
-
On the Supremum of the Counting Function for the a-Values of a Meromorphic Function
In this dissertation two results are proved concerning the distribution of the solutions of the equation f(z) = a where f is meromorphic in the plane.
-
Contributions to Diophantine Approximation on Spheres
… spheres. In the first contribution, we study the counting function of rational approximations with given bounds on the denominator and satisfying the critical Dirichlet exponent on the sphere $S^d$, $d\geq 3$. We prove an effective estimate for this counting function, with an error term of square …
-
An explicit version of Chebotarev's density theorem
… provides an explicit error term for the prime counting function in Chebotarev's density theorem. We rework their argument and improve their bounds. The second part improves further by investigating more modern tools. Some of the main ideas are deriving an explicit formula for a smooth version …
-
Extending Erdős-Kac and Selberg-Sathe to Beurling primes with controlled integer counting functions
… Selberg substantially refined a formula for the counting function of products of k primes with some uniformity on k. A set of Beurling primes is any countable multiset of the reals with elements that tend towards infinity. The set of Beurling primes has a corresponding multiset of Beurling …
-
On Beurling's Theory of Generalized Numbers
… generated by P. We let $N(x)$ be the counting function of the set N. In this thesis we give continuous versions of generalized number systems considered by R. S. Hall (Proc. Amer. Math. Soc. 40 (1973) 79-82). We provide an explicit calculation of the associated zeta function, which in …
-
Asymptotic distribution of beurling 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)$.
-
On the relation between asymptotic behaviour of Neumann eigenvalue counting functions and the inner Minkowski content of fractal drums
… bound of the remainder term of the spectral counting function of the Neumann Laplacian at \(t\) asymptotic to \(t^{\delta/2}\). It is discussed how the cardinality of this cover relates to the upper inner Minkowski content and in particular we show that \(p\)-Rohde snowflakes satisfy this …
-
The Selberg Trace Formula & Prime Orbit Theorem
… prove the Prime Orbit Theorem. That is, for the counting function of exponential of primitive lengths, de ned as 0(x) = #fl : l 2 LS and el xg
-
Explicit Mertens' theorems for number fields
… ingredient is an explicit estimate for the ideal-counting function. This explicit estimate is of independent interest too, because it generalises the widely useful floor function into the number fields setting. Therefore, we update the latest explicit estimate for the ideal-counting function in …
-
Isometries of Besov Type Spaces among Composition Operators
… alpha >1 be the Besov type space of holomorphic functions on the unit disk D. Given Phi, a holomorphic self map of D, we show the composition operator CPhi is an isometry on Bp,alpha if and only if the weighted composition operator WPhiPhi, is an isometry on the weighted Bergman space Ap,alpha. …
-
Spectral Theory on Fractals
… the asymptotic behaviour of the eigenvalue counting function under a given boundary condition. It remains true that for these generalised operators, the eigenvalue counting function obeys a power law as its asymptotic behaviour.<br/><br/>The goal of this thesis is threefold. We first show …
-
Topics in spectral theory of differential operators /
This dissertation is devoted to two eigenvalue counting problems: Determining the asymptotic behavior of large eigenvalues of self-adjoint extensions of partial differential operators, and computing the number of negative eigenvalues for bounded from below operators with compact resolvents. In the …
-
Asymptotic Counting Formulas for Markoff-Hurwitz Tuples
… equation. We prove explicit asymptotic formulas counting solutions to this generalized equation with and without a congruence restriction. After normalizing and linearizing the equation, we show that all but finitely many solutions appear in the orbit of a certain semigroup of maps acting on …
-
Precise Entropy Characterization for Compact Hypoelliptic Pseudo-Differential Operators
… rate at which neural networks can approximate functions generated by such operators. Our main contribution is a method to determine the eigenvalue counting function (ECF) of a given compact hypoelliptic PDO purely from its symbol. Using this approach, we obtain an o(1)-precise asymptotic …
-
The average number of amicable pairs and aliquot cycles for a family of elliptic curves
… Let \pi_{E,L}(X) denote the aliquot cycle counting function with p<=X. They conjectured for elliptic curves without complex multiplication that \pi_{E,L}(X) ~ \sqrt{X}/(\log X)^{L}. Jones refined this conjecture to give an explicit constant, namely \pi_{E,L}~C_{E,L}\sqrt{X}/(\log X)^L. In …
-
Analysis of the prime zeta function zeroes placement patterns /
The prime zeta function, P (s) = ∑_{p∈P} p^{−s}, encodes fundamental information about the distribution of prime numbers. Although its analytic continuation obtained via the Möbius inversion formula is well understood, the structure and placement patterns of its zeros remain underexplored. This …
-
Counting prime polynomials and measuring complexity and similarity of information
… asymptotic expansion for the prime polynomial counting function is derived. The approximation given is more accurate than previous results in the literature while requiring very little computational effort. In this context asymptotic series expansions for Lerch transcendent, Eulerian …
Page 1 of 2