Ordinary mod p representations of the metaplectic cover of p-adic SL_2

We classify the genuine ordinary mod p representations of the metaplectic group SL(2,F)-tilde, where F is a p-adic field, and compute its genuine mod p spherical and Iwahori Hecke algebras. The motivation is an interest in a possible correspondence between genuine mod p representations of SL(2,F)-tilde and mod p representations of the dual group PGL(2,F), so we also compare the two Hecke algebras to the mod p spherical and Iwahori Hecke algebras of PGL(2,F). We show that the genuine mod p spherical Hecke algebra of SL(2,F)-tilde is isomorphic to the mod p spherical Hecke algebra of PGL(2,F), and that one can choose an isomorphism which is compatible with a natural, though partial, correspondence of unramified ordinary representations via the Hecke action on their spherical vectors. We then show that the genuine mod p Iwahori Hecke algebra of SL(2,F)-tilde is a subquotient of the mod p Iwahori Hecke algebra of PGL(2,F), but that the two algebras are not isomorphic. This is in contrast to the situation in characteristic 0, where by work of Savin one can recover the local Shimura correspondence for representations generated by their Iwahori fixed vectors from an isomorphism of Iwahori Hecke algebras.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

On Selmer groups and factoring p-adic L-functions

Thesis (Ph.D.)--University of Washington, 2016-06

Matrix Processors Using p-adic Arithmetic for Exact Linear Computations

A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-adic expansion. The four basic arithmetic algorithms for these codes are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure.

Exact algorithms for p-adic fields and epsilon constant conjectures

We develop several algorithms for computations in Galois extensions of p-adic fields. Our algorithms are based on existing algorithms for number fields and are exact in the sense that we do not need to consider approximations to p-adic numbers. As an application we describe an algorithmic approach to prove or disprove various conjectures for local and global epsilon constants.

Indecomposable and noncrossed product division algebras over function fields of smooth p-adic curves

We construct indecomposable and noncrossed product division algebras over function fields of connected smooth curves X over Z(p). This is done by defining an index preserving morphism s: Br(<(K(X))over cap>)` --> Br(K(X))` which splits res : Br(K (X)) --> Br(<(K(X))over cap>), where <(K(X))over cap> is the completion of K (X) at the special fiber, and using it to lift indecomposable and noncrossed product division algebras over <(K(X))over cap>. (C) 2010 Elsevier Inc. All rights reserved.

Forma traço sobre algumas extensões galoisianas de corpos p-Ádicos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

p-adic L functions and trivial zeroes

The following is adapted from the notes for the lecture. It announces results and conjectures about values of the p-adic L function of the symmetric square of an elliptic curve.

Improved Cryptoanalysis of the Self-shrinking P-adic Cryptographic Generator

The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show that the sequence generated by a SSPCG has a large period, large linear complexity and is stable against the cryptographic attacks. This gives the reason to consider the SSPSG as suitable for critical cryptographic applications in stream cipher encryption algorithms.

Computations in Relative Algebraic K-Groups

Let G be finite group and K a number field or a p-adic field with ring of integers O_K. In the first part of the manuscript we present an algorithm that computes the relative algebraic K-group K_0(O_K[G],K) as an abstract abelian group. We solve the discrete logarithm problem, both in K_0(O_K[G],K) and the locally free class group cl(O_K[G]). All algorithms have been implemented in MAGMA for the case K = \IQ. In the second part of the manuscript we prove formulae for the torsion subgroup of K_0(\IZ[G],\IQ) for large classes of dihedral and quaternion groups.

Field validation of controlled Monte Carlo data generation for statistical damage identification employing Mahalanobis squared distance

This article presents the field applications and validations for the controlled Monte Carlo data generation scheme. This scheme was previously derived to assist the Mahalanobis squared distance–based damage identification method to cope with data-shortage problems which often cause inadequate data multinormality and unreliable identification outcome. To do so, real-vibration datasets from two actual civil engineering structures with such data (and identification) problems are selected as the test objects which are then shown to be in need of enhancement to consolidate their conditions. By utilizing the robust probability measures of the data condition indices in controlled Monte Carlo data generation and statistical sensitivity analysis of the Mahalanobis squared distance computational system, well-conditioned synthetic data generated by an optimal controlled Monte Carlo data generation configurations can be unbiasedly evaluated against those generated by other set-ups and against the original data. The analysis results reconfirm that controlled Monte Carlo data generation is able to overcome the shortage of observations, improve the data multinormality and enhance the reliability of the Mahalanobis squared distance–based damage identification method particularly with respect to false-positive errors. The results also highlight the dynamic structure of controlled Monte Carlo data generation that makes this scheme well adaptive to any type of input data with any (original) distributional condition.

Field Assessments of Control Agents for Lesser Mealworm (Coleoptera: Tenebrionidae) Using Litter Sampling

Spinosad, diatomaceous earth, and cyfluthrin were assessed on two broiler farms at Gleneagle and Gatton in southeastern Queensland, Australia in 2004-2005 and 2007-2009, respectively to determine their effectiveness in controlling lesser mealworm, Alphitobius diaperinus (Panzer) (Coleoptera: Tenebrionidae). Insecticide treatments were applied mostly to earth or 'hard' cement floors of broiler houses before the placement of new bedding. Efficacy of each agent was assessed by regular sampling of litter and counting of immature stages and adult beetles, and comparing insect counts in treatments to counts in untreated houses. Generally, the lowest numbers of lesser mealworm were recorded in the house with hard floors, these numbers equalling the most effective spinosad applications. The most effective treatment was a strategic application of spinosad under feed supply lines on a hard floor. In compacted earth floor houses, mean numbers of lesser mealworms for two under-feed-line spinosad treatments (i.e., 2-m-wide application at 0.18 g of active insecticide (g [AI]) in 100-ml water/m(2), and 1-m-wide application at 0.11 g ([AI] in 33-ml water/m(2)), and an entire floor spinosad treatment (0.07 g [AI] in 86-ml water/m2) were significantly lower (i.e., better control) than those numbers for cyfluthrin, and no treatment (controls). The 1-m-wide under-feed-line treatment was the most cost-effective dose, providing similar control to the other two most effective spinosad treatments, but using less than half the active component per broiler house. No efficacy was demonstrated when spinosad was applied to the surface of bedding in relatively large volumes of water. All applications of diatomaceous earth, applied with and without spinosad, and cyfluthrin at the label rate of 0.02 g (AI)/100-ml water/m(2) showed no effect, with insect counts not significantly different to untreated controls. Overall, the results of this field assessment indicate that cyfluthrin (the Australian industry standard) and diatomaceous earth were ineffective on these two farms and that spinosad can be a viable alternative for broiler house use.