1,324 research outputs found

    Artin's primitive root conjecture -a survey -

    Get PDF
    This is an expanded version of a write-up of a talk given in the fall of 2000 in Oberwolfach. A large part of it is intended to be understandable by non-number theorists with a mathematical background. The talk covered some of the history, results and ideas connected with Artin's celebrated primitive root conjecture dating from 1927. In the update several new results established after 2000 are also discussed.Comment: 87 pages, 512 references, to appear in Integer

    Computing discrete logarithms in subfields of residue class rings

    Full text link
    Recent breakthrough methods \cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method \cite{jl}. To solve discrete logarithms in a finite extension of a finite field \F, a polynomial h(x) \in \F[x] of a special form is constructed with an irreducible factor g(x) \in \F[x] of the desired degree. The special form of h(x)h(x) is then exploited in generating multiplicative relations that hold in the residue class ring \F[x]/h(x)\F[x] hence also in the target residue class field \F[x]/g(x)\F[x]. An interesting question in this context and addressed in this paper is: when and how does a set of relations on the residue class ring determine the discrete logarithms in the finite fields contained in it? We give necessary and sufficient conditions for a set of relations on the residue class ring to determine discrete logarithms in the finite fields contained in it. We also present efficient algorithms to derive discrete logarithms from the relations when the conditions are met. The derived necessary conditions allow us to clearly identify structural obstructions intrinsic to the special polynomial h(x)h(x) in each of the aforementioned methods, and propose modifications to the selection of h(x)h(x) so as to avoid obstructions.Comment: arXiv admin note: substantial text overlap with arXiv:1312.167

    p-Adic estimates of Hamming weights in Abelian codes over Galois rings

    Get PDF
    A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic codes is proved in this paper by means of counting polynomial techniques introduced by Wilson along with a technique known as trace-averaging introduced here. The original theorem of McEliece concerned cyclic codes over prime fields. Delsarte and McEliece later extended this to Abelian codes over finite fields. Calderbank, Li, and Poonen extended McEliece's original theorem to cover cyclic codes over the rings /spl Zopf//sub 2//sup d/, Wilson strengthened their results and extended them to cyclic codes over /spl Zopf//sub p//sup d/, and Katz strengthened Wilson's results and extended them to Abelian codes over /spl Zopf//sub p//sup d/. It is natural to ask whether there is a single analogue of McEliece's theorem which correctly captures the behavior of codes over all finite fields and all rings of integers modulo prime powers. In this paper, this question is answered affirmatively: a single theorem for Abelian codes over Galois rings is presented. This theorem contains all previously mentioned results and more

    Some Concepts of Modern Algebraic Geometry: Point, Ideal and Homomorphism

    Get PDF
    Starting from classical algebraic geometry over the complex numbers (as it can be found for example in Griffiths and Harris it was the goal of these lectures to introduce some concepts of the modern point of view in algebraic geometry. Of course, it was quite impossible even to give an introduction to the whole subject in such a limited time. For this reason the lectures and now the write-up concentrate on the substitution of the concept of classical points by the notion of ideals and homomorphisms of algebras.Comment: 36 pages. This is a write-up of lectures given at the ``Kleine Herbstschule 93'' of the Graduiertenkolleg ``Mathematik im Bereich Ihrer Wechselwirkungen mit der Physik'' at the Ludwig-Maximilians-Universitaet Muenche

    Algorithms in algebraic number theory

    Get PDF
    In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers.Comment: 34 page
    • …
    corecore