Algorithmic Algebraic Number Theory

Author: M. Pohst
Publisher: Cambridge University Press
ISBN: 9780521596695
Size: 69.51 MB
Format: PDF, Docs
View: 3897
Classic book, addressed to all lovers of number theory.

The Theory Of Partitions

Author: George E. Andrews
Publisher: Cambridge University Press
ISBN: 9780521637664
Size: 37.10 MB
Format: PDF, Mobi
View: 1338
Discusses mathematics related to partitions of numbers into sums of positive integers.

Computation With Finitely Presented Groups

Author: Charles C. Sims
Publisher: Cambridge University Press
ISBN: 9780521432139
Size: 78.68 MB
Format: PDF, ePub
View: 1167
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.

Boolean Functions

Author: Yves Crama
Publisher: Cambridge University Press
ISBN: 1139498630
Size: 65.29 MB
Format: PDF
View: 4566
Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.

Algorithmic Number Theory

Author: Henri Cohen
Publisher: Springer Science & Business Media
ISBN: 9783540615811
Size: 77.54 MB
Format: PDF
View: 2038
This book constitutes the refereed post-conference proceedings of the Second International Algorithmic Number Theory Symposium, ANTS-II, held in Talence, France in May 1996. The 35 revised full papers included in the book were selected from a variety of submissions. They cover a broad spectrum of topics and report state-of-the-art research results in computational number theory and complexity theory. Among the issues addressed are number fields computation, Abelian varieties, factoring algorithms, finite fields, elliptic curves, algorithm complexity, lattice theory, and coding.

Essays In Mathematics And Its Applications

Author: Themistocles Rassias
Publisher: Springer
ISBN: 331931338X
Size: 33.68 MB
Format: PDF, ePub, Docs
View: 5455
This volume, dedicated to the eminent mathematician Vladimir Arnold, presents a collection of research and survey papers written on a large spectrum of theories and problems that have been studied or introduced by Arnold himself. Emphasis is given to topics relating to dynamical systems, stability of integrable systems, algebraic and differential topology, global analysis, singularity theory and classical mechanics. A number of applications of Arnold’s groundbreaking work are presented. This publication will assist graduate students and research mathematicians in acquiring an in-depth understanding and insight into a wide domain of research of an interdisciplinary nature.

Algebraic Geometry And Its Applications

Author: Jean Chaumine
Publisher: World Scientific
ISBN: 9812793429
Size: 79.91 MB
Format: PDF, Mobi
View: 5935
This volume covers many topics, including number theory, Boolean functions, combinatorial geometry, and algorithms over finite fields. It contains many new, theoretical and applicable results, as well as surveys that were presented by the top specialists in these areas. New results include an answer to one of Serre's questions, posted in a letter to Top; cryptographic applications of the discrete logarithm problem related to elliptic curves and hyperelliptic curves; construction of function field towers; construction of new classes of Boolean cryptographic functions; and algorithmic applications of algebraic geometry.