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 5 of 5 for “"p-Adic Analysis"”.

  1. Multiplicative Orientations of K -Theory and P-Adic Analysis

    … description involves producing measures on the p-adic units with certain moments. In his thesis, Ando produced a criterion for an orientation to be Hinfinity. His theorem is a condition on the induced formal group law. We connect these two classifications by producing measures of the type above …

    uiuc Repository record for Multiplicative Orientations of K -Theory and P-Adic Analysis (opens in a new tab)

  2. Existence problems of primitive polynomials over finite fields

    … of the field is 2 or 3, we also use p-adic analysis. In addition to proving the previously unestablished cases of the conjecture, we also offer shorter and self-contained proof of the conjecture when the first coefficient of the polynomial is prescibed, and of some other cases where the …

    glasgow Repository record for Existence problems of primitive polynomials over finite fields (opens in a new tab)

  3. On the distribution of central values of Hecke L-functions

    … L-functions.</p> <p>Using tools from p-adic analysis which are analogues of traditional archimedean techniques, we prove the <em>q</em>-aspect analogue of Heath-Brown’s result on the twelfth power moment of the Riemann zeta function for Dirichlet <em>L</em>-functions to odd prime power …

    bryn-mawr Repository record for On the distribution of central values of Hecke L-functions (opens in a new tab)

  4. Motivic integration over nilpotent structures

    <p>This thesis concerns developing the notion of Motivic Integration in such a way that it captures infinitesimal information yet reduces to the classical notion of motivic integration for reduced schemes. Moreover, I extend the notion of Motivic Integration from a discrete valuation ring to any …

    cuny-grad Repository record for Motivic integration over nilpotent structures (opens in a new tab)

  5. Classifying Polynomials With Reducible Nonreciprocal Parts and the Factorization of Values of Polynomials

    … where |n|<sub>p</sub> is the usual p-adic norm of n. In 1984, Stewart applied Baker's theorem to prove non-trivial, computationally effective upper bounds for [n(n + 1)···(n + k)]<sub>S</sub> for any integer k > 0. Effective upper bounds have also been given by Bennett, Filaseta, and …

    south-carolina Repository record for Classifying Polynomials With Reducible Nonreciprocal Parts and the Factorization of Values of Polynomials (opens in a new tab)