Lacunary Polynomials Over Finite Fields
Lacunary Polynomials Over Finite Fields

Author: L. Rédei

Publisher: Elsevier

Published: 2014-05-12

Total Pages: 268

ISBN-13: 1483257835

DOWNLOAD EBOOK

Lacunary Polynomials Over Finite Fields focuses on reducible lacunary polynomials over finite fields, as well as stem polynomials, differential equations, and gaussian sums. The monograph first tackles preliminaries and formulation of Problems I, II, and III, including some basic concepts and notations, invariants of polynomials, stem polynomials, fully reducible polynomials, and polynomials with a restricted range. The text then takes a look at Problem I and reduction of Problem II to Problem III. Topics include reduction of the marginal case of Problem II to that of Problem III, proposition on power series, proposition on polynomials, and preliminary remarks on polynomial and differential equations. The publication ponders on Problem III and applications. Topics include homogeneous elementary symmetric systems of equations in finite fields; divisibility maximum properties of the gaussian sums and related questions; common representative systems of a finite abelian group with respect to given subgroups; and difference quotient of functions in finite fields. The monograph also reviews certain families of linear mappings in finite fields, appendix on the degenerate solutions of Problem II, a lemma on the greatest common divisor of polynomials with common gap, and two group-theoretical propositions. The text is a dependable reference for mathematicians and researchers interested in the study of reducible lacunary polynomials over finite fields.

Handbook of Finite Fields
Handbook of Finite Fields

Author: Gary L. Mullen

Publisher: CRC Press

Published: 2013-06-17

Total Pages: 1048

ISBN-13: 1439873828

DOWNLOAD EBOOK

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and

Computational and Algorithmic Problems in Finite Fields
Computational and Algorithmic Problems in Finite Fields

Author: Igor Shparlinski

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 253

ISBN-13: 940111806X

DOWNLOAD EBOOK

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Finite Fields: Theory and Computation
Finite Fields: Theory and Computation

Author: Igor Shparlinski

Publisher: Springer Science & Business Media

Published: 2013-03-09

Total Pages: 532

ISBN-13: 940159239X

DOWNLOAD EBOOK

This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.

Finite Fields and Applications
Finite Fields and Applications

Author: Stephen Cohen

Publisher: Cambridge University Press

Published: 1996-09-28

Total Pages: 425

ISBN-13: 052156736X

DOWNLOAD EBOOK

Finite fields are algebraic structures in which there is much research interest. This book gives a state-of-the-art account of finite fields and their applications in communications (coding theory, cryptology), combinatorics, design theory, quasirandom points, algorithms and their complexity. Typically, theory and application are tightly interwoven in the survey articles and original research papers included here. The book also demonstrates interconnections with other branches of pure mathematics such as number theory, group theory and algebraic geometry. This volume is an invaluable resource for any researcher in finite fields or related areas.

Number Theory, Analysis, and Combinatorics
Number Theory, Analysis, and Combinatorics

Author: János Pintz

Publisher: Walter de Gruyter

Published: 2013-12-12

Total Pages: 418

ISBN-13: 3110282429

DOWNLOAD EBOOK

Paul Turán, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfréd Rényi Institute of Mathematics, the János Bolyai Mathematical Society and the Mathematical Institute of Eötvös Loránd University organized an international conference devoted to Paul Turán's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics. The conference was held in Budapest, August 22-26, 2011. Some of the invited lectures reviewed different aspects of Paul Turán's work and influence. Most of the lectures allowed participants to report about their own work in the above mentioned areas of mathematics.

Orthogonal Latin Squares Based on Groups
Orthogonal Latin Squares Based on Groups

Author: Anthony B. Evans

Publisher: Springer

Published: 2018-08-17

Total Pages: 537

ISBN-13: 3319944304

DOWNLOAD EBOOK

This monograph presents a unified exposition of latin squares and mutually orthogonal sets of latin squares based on groups. Its focus is on orthomorphisms and complete mappings of finite groups, while also offering a complete proof of the Hall–Paige conjecture. The use of latin squares in constructions of nets, affine planes, projective planes, and transversal designs also motivates this inquiry. The text begins by introducing fundamental concepts, like the tests for determining whether a latin square is based on a group, as well as orthomorphisms and complete mappings. From there, it describes the existence problem for complete mappings of groups, building up to the proof of the Hall–Paige conjecture. The third part presents a comprehensive study of orthomorphism graphs of groups, while the last part provides a discussion of Cartesian projective planes, related combinatorial structures, and a list of open problems. Expanding the author’s 1992 monograph, Orthomorphism Graphs of Groups, this book is an essential reference tool for mathematics researchers or graduate students tackling latin square problems in combinatorics. Its presentation draws on a basic understanding of finite group theory, finite field theory, linear algebra, and elementary number theory—more advanced theories are introduced in the text as needed.