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 19 of 19 for “"Counting functions"”.
-
On the distributions of prime divisor counting functions
… the natural numbers. In this thesis, using a new counting argument, we establish the first and second moments of all these arithmetic functions over the sets of h-free and h-full numbers. We show that the normal order of ω(n) is log log n for both h-free and h-full numbers. For Ω(n), the normal …
-
A survey of Büthe's method for estimating prime counting functions
… provides explicit bounds for the Chebyshev prime counting function ψ(x). This thesis aims to produce a detailed survey of the first part (from page 2483 to page 2494) of the paper, ‘Estimating π(x) and Related Functions Under Partial RH Assumptions’ by Jan B ̈uthe published in 2016. His article …
-
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 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 Integrated Density of States for Operators on Groups
… admit a well-defined normalized eigenvalue counting function. The limit of the normalized eigenvalue counting functions when |Qn | → ∞ (if it exists) is called the integrated density of states (IDS). It is a distribution function of a probability measure encoding the distribution of the …
-
Sparse Automatic Sets
… sets shows that they are either sparse, having counting functions that grow relatively slowly, or they are not sparse, in which case their counting functions grow reasonably fast. While this dichotomy has been known to hold for some time, there has not---to this point in time---been a systematic …
-
Density of direct factors in normed arithmetical semi-groups.
… to unique factorization semi-groups whose counting functions satisfy some regularity conditions. The treatment is broad enough, however, to include, in addition to the semi-group N* of positive integers, analogous "normalized" semi-groups of Gaussian integers and other algebraic integers.
-
On the E-polynomials of a family of character varieties
… count, and applying a result of N. Katz on the counting functions. To compute the number of F [subscript q]-points of these varieties as a function of q, we used a formula of Frobenius. Our calculations made use of the character tables of Gl [subscript n](q) and Sl subscript n](q), previously …
-
Closed Range Composition Operators on BMOA
… denoted by Cφ. Reverse Carleson type conditions, counting functions and sampling sets are important tools to give a complete characterization of closed range composition operators on BMOA and on Qp for all p ∈ (0,∞). Let B denote the Bloch space, let H2 denote the Hardy space. We show that if Cφ …
-
Mixed Zeta Functions
… we show that under certain conditions on K, such functions extend to meromorphic functions on the complex plane, or to some region strictly larger than the domain of absolute convergence, and have real poles and polynomial growth in vertical strips. When the weighting function is identically 1, we …
-
Congruences in modular, Jacobi, Siegel, and mock modular forms with applications
… We describe the Ramanujan congruences in the counting functions for overparitions, overpartition pairs, crank differences, and Andrews' two-coloured generalized Frobenius partitions. We also study Ramanujan congruences in the Fourier coefficients of certain ratios of Eisenstein series. We also …
-
On Three Ehrhart Theories & Simplicial Hyperplane Arrangements
… particular, we provide two rational generating functions. Secondly, we prove two original theorems for calculating the equivariant Ehrhart series using invariant triangulations. Finally, we present Sagemath code to calculate the equivariant Ehrhart series. In Chapter 2, which is joint work with …
-
Ham sandwiches, staircases and counting polynomials
… of four chapters that are largely independent. Counting Functions as Hilbert Functions. Steingrímsson showed that the chromatic polynomial of a graph, shifted by one, is the Hilbert function of a relative Stanley-Reisner ideal. Dall and myself show that the modluar flow and tension polynomials …
-
Irrational ellipsoid embeddings and a canonical grading of embedded contact homology
… More specifically, we analyze lattice point counting functions to deduce that the existence of an accumulation point of an infinite staircase is impossible for all irrational targets minus a set of irrationals in bijection with $\N$, for which the question has yet to be resolved.
-
Sums of Multiplicative Functions Over Integers Without Large Prime Factors and Related Differential Difference Equations
… naturally 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 …
-
The distribution of prime numbers in short intervals
… the asymptotic for the weighted sums for prime-counting functions with parameters restricted to dyadic intervals. These results are crucial for the complete understanding of the final proof by Baker and Harman, which we explain in detail in Chapter 6. Finally, we introduce an optimisation …
-
Proof complexity of systems of branching programs
… a 1-transition. PBPs compute mono-tone Boolean functions, much like negation-free circuits or formulas do, but constitute a positive version of (non- uniform) NL, rather than P or NC1, respectively. We introduce eLNDT`, the positive fragment of eLNDT, that reasons about PBPs by considering …
-
Profilaktyka lęku przed matematyką. Eksperyment pedagogiczny
… research that describes, among others: counting functions or the functioning of brain areas related to mathematics, e.g. the transfer effect or changes in the amygdala related to math phobia. The relationship between performing mathematical operations and working memory, the SNARC …
-
Ιδιότητες συναρτήσεων μέτρησης πλήθους λύσεων σε προβλήματα με εύκολη απόφαση ύπαρξης λύσης: πληρότητα, προσεγγισιμότητα, μαρκοβιανές αλυσίδες, αλλαγές φάσης
The complexity class #P is the class of functions that count the number of solutions to problems in NP, e.g. #SAT is the function that on input a formula ϕ returns the number of satisfying assignments of ϕ. NP-complete problems are hard to count, but there exist hard counting problems with decision …