Euler characteristics and elliptic curves

Let E be a modular elliptic curve over ℚ, without complex multiplication; let p be a prime number where E has good ordinary reduction; and let F∞ be the field obtained by adjoining to ℚ all p-power division points on E. Write G∞ for the Galois group of F∞ over ℚ. Assume that the complex L-series of E over ℚ does not vanish at s = 1. If p ⩾ 5, we make a precise conjecture about the value of the G∞-Euler characteristic of the Selmer group of E over F∞. If one makes a standard conjecture about the behavior of this Selmer group as a module over the Iwasawa algebra, we are able to prove our conjecture. The crucial local calculations in the proof depend on recent joint work of the first author with R. Greenberg.

The structure of Selmer groups

The purpose of this article is to describe certain results and conjectures concerning the structure of Galois cohomology groups and Selmer groups, especially for abelian varieties. These results are analogues of a classical theorem of Iwasawa. We formulate a very general version of the Weak Leopoldt Conjecture. One consequence of this conjecture is the nonexistence of proper Λ-submodules of finite index in a certain Galois cohomology group. Under certain hypotheses, one can prove the nonexistence of proper Λ-submodules of finite index in Selmer groups. An example shows that some hypotheses are needed.

Congruences between modular forms: Raising the level and dropping Euler factors

We discuss the relationship among certain generalizations of results of Hida, Ribet, and Wiles on congruences between modular forms. Hida’s result accounts for congruences in terms of the value of an L-function, and Ribet’s result is related to the behavior of the period that appears there. Wiles’ theory leads to a class number formula relating the value of the L-function to the size of a Galois cohomology group. The behavior of the period is used to deduce that a formula at “nonminimal level” is obtained from one at “minimal level” by dropping Euler factors from the L-function.

High-speed polynomial basis multipliers over GF(2(m)) for special pentanomial.

Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.

Lectures in abstract algebra.

v. 1. Basic concepts.--v. 2. Linear algebra.--v. 3. Theory of fields and Galois theory.

On Selmer groups and factoring p-adic L-functions

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

Properties of sparse random matrices over finite fields

Typical properties of sparse random matrices over finite (Galois) fields are studied, in the limit of large matrices, using techniques from the physics of disordered systems. For the case of a finite field GF(q) with prime order q, we present results for the average kernel dimension, average dimension of the eigenvector spaces and the distribution of the eigenvalues. The number of matrices for a given distribution of entries is also calculated for the general case. The significance of these results to error-correcting codes and random graphs is also discussed.

Some new Results for Additive Self-Dual Codes over GF(4)

* Supported by COMBSTRU Research Training Network HPRN-CT-2002-00278 and the Bulgarian National Science Foundation under Grant MM-1304/03.

Symplectic Representation of a Braid Group on 3-Sheeted Covers of the Riemann Sphere

We define Picard cycles on each smooth three-sheeted Galois cover C of the Riemann sphere. The moduli space of all these algebraic curves is a nice Shimura surface, namely a symmetric quotient of the projective plane uniformized by the complex two-dimensional unit ball. We show that all Picard cycles on C form a simple orbit of the Picard modular group of Eisenstein numbers. The proof uses a special surface classification in connection with the uniformization of a classical Picard-Fuchs system. It yields an explicit symplectic representation of the braid groups (coloured or not) of four strings.

Henselian Discrete Valued Fields Admitting One-Dimensional Local Class Field Theory

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.

Quaternion Extensions of Order 16

2000 Mathematics Subject Classification: 12F12

Mining dynamic databases for frequent closed itemsets

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Mining dynamic databases for frequent closed itemsets

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Algebraic geometric codes over rings

The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear codes over finite rings. In this thesis, we combine these two approaches to coding theory by introducing and studying algebraic geometric codes over rings.

Fuzzy Adjunctions revisited

En este trabajo se intenta obtener la noción de adjunción más débil entre estructuras difusas. Este trabajo continúa la línea de investigación en el estudio y construcción d adjunciones que han realizado los autores en contribuciones anteriores. Nos centraremos ahora en la noción de relación difusa que es en cierto sentido interpretable como una función difusa. Existen varios trabajos en la literatura relacionados con este tema. Entre todos ellos, trabajaremos con un enfoque próximo al de Ciric et al cuando definen las denominadas funciones parciales difusas. El nuevo concepto estudiado es el de relaciones difusas funcionales y la construcción de adjunciones entre ellas.