Search Constraints

Start Over
Filtering by: Creator Petsche, Clayton Remove constraint Creator: Petsche, Clayton Committee Member Schmidt, Thomas A. Remove constraint Committee Member: Schmidt, Thomas A.

Search Results

  • An inner product on adelic measures

    Creator:
    Oberly, Peter J.
    Abstract:
    We define an inner product on a vector space of adelic measures over a number field $K$. We find that the norm induced by this inner product governs weak convergence at each place of $K$. The canonical adelic measure associated to a rational map is in this vector space, and...
    Resource Type:
    Dissertation
    Full Text:
    Product on Adelic Measures. Abstract Approved: Clayton J. Petsche We define an inner product on a vector

  • Fourier Analysis and Equidistribution on the p-adic Integers

    Creator:
    Somasunderam, Naveen
    Abstract:
    In this dissertation, we use Fourier-analytic methods to study questions of equidistribution on the compact abelian group Zp of p-adic integers. In particu- lar, we prove a LeVeque-type Fourier analytic upper bound on the discrepancy of sequences. We establish p-adic analogues of the classical Dirichlet and Fejér kernels on R/Z,...
    Resource Type:
    Dissertation
    Full Text:
    Analysis and Equidistribution on the p-adic Integers Abstract approved: Clayton J. Petsche In this

  • Overpartition Ranks, Cranks, and Frobenius Representations

    Creator:
    Morrill, Thomas
    Abstract:
    We generalize overpartition rank and crank generating functions to obtain k-fold variants, and give a combinatorial interpretation for each. The k-fold crank generating function is interpreted by extending the first and second residual cranks to a natural infinite family. The k-fold rank generating functions generate two families of buffered Frobenius...
    Resource Type:
    Dissertation

  • Periodicity and Partition Congruences

    Creator:
    Al-Saedi, Ali Hammood
    Abstract:
    In this note, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our extended technique could be a useful tool to prove congruences for certain types of combinatorial...
    Resource Type:
    Dissertation