Download or read book The Number of Polynomial Functions Which Permute the Matrices Over a Finite Field written by Joel V Brawley (Jr) and published by . This book was released on 1974 with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: Let F denote a finite field and let f sub (n x n) denote the n x n matrices over F.A function f:F sub (n x n) maps to F sub (n x n) is called a (scalar) polynomial function on F sub (n x n) if and only if there exists a polynomial f(x) an element of F(in brackets:(x)) which represents f under substitution. A formula is obtained for the number of polynomial function on F sub (n x n) which are permutations of F sub (n x n). In the process a procedure is outlined for obtaining a unique polynomial representations of each permutation polynomial function on F sub (n x n).
Download or read book Scalar Polynomial Functions on the Nxn Matrices Over a Finite Field written by Joel Vincent Brawley and published by . This book was released on 1973 with total page 35 pages. Available in PDF, EPUB and Kindle. Book excerpt: The use of the theory of finite fields in areas of discrete linear modeling such as coding theory, finite linear sequential machines, algebraic cryptography and the construction of block designs is well-known. Many times one has the task of constructing (based on a finite field) a function having certain prescribed properties. Of such a nature is the material contained in the report. In particular, the authors determined among other things, necessary and sufficient conditions on a polynomial f(x) with coefficients in a finite field F in order that it defines via substitution a one-one onto function (a permutation) from F(nxn), the nxn matrices over F, to F(nxn).
Download or read book Infinite Algebraic Extensions of Finite Fields written by Joel V. Brawley and published by American Mathematical Soc.. This book was released on 1989 with total page 126 pages. Available in PDF, EPUB and Kindle. Book excerpt: Over the last several decades there has been a renewed interest in finite field theory, partly as a result of important applications in a number of diverse areas such as electronic communications, coding theory, combinatorics, designs, finite geometries, cryptography, and other portions of discrete mathematics. In addition, a number of recent books have been devoted to the subject. Despite the resurgence in interest, it is not widely known that many results concerning finite fields have natural generalizations to abritrary algebraic extensions of finite fields. The purpose of this book is to describe these generalizations. After an introductory chapter surveying pertinent results about finite fields, the book describes the lattice structure of fields between the finite field $GF(q)$ and its algebraic closure $\Gamma (q)$. The authors introduce a notion, due to Steinitz, of an extended positive integer $N$ which includes each ordinary positive integer $n$ as a special case. With the aid of these Steinitz numbers, the algebraic extensions of $GF(q)$ are represented by symbols of the form $GF(q^N)$. When $N$ is an ordinary integer $n$, this notation agrees with the usual notation $GF(q^n)$ for a dimension $n$ extension of $GF(q)$. The authors then show that many of the finite field results concerning $GF(q^n)$ are also true for $GF(q^N)$. One chapter is devoted to giving explicit algorithms for computing in several of the infinite fields $GF(q^N)$ using the notion of an explicit basis for $GF(q^N)$ over $GF(q)$. Another chapter considers polynomials and polynomial-like functions on $GF(q^N)$ and contains a description of several classes of permutation polynomials, including the $q$-polynomials and the Dickson polynomials. Also included is a brief chapter describing two of many potential applications. Aimed at the level of a beginning graduate student or advanced undergraduate, this book could serve well as a supplementary text for a course in finite field theory.
Download or read book Dickson Polynomials written by Lidl and published by Chapman and Hall/CRC. This book was released on 1993-03-29 with total page 224 pages. Available in PDF, EPUB and Kindle. Book excerpt: Dickson polynomials are closely related with Chebyshev polynomials. They have a variety of algebraic and number theoretic properties and satisfy simple second-order linear differential equations and linear recurrences. For suitable parameters they form a commutative semigroup under composition. Dickson polynomials are of fundamental importance in the theory of permutation polynomials and related topics. In particular, they serve as examples of integral polynomials which induce permutations for infinitely many primes. According to 'Schur's conjecture' there are essentially no other examples. Dickson polynomials are also important in cryptology and for pseudoprimality testing. The book provides a comprehensive up-to-date collection of results concerning Dickson polynomials and presents several applications. It also treats generalizations to polynomials in several variables and related rational function like Redei functions. Each of the seven chapters includes exercises and notes. Tables of Dickson polynomials are given in the Appendix. For most parts of the text only the basic theory of groups, rings and fields is required. The proof of 'Schur's Conjecture' is largely self-contained but is based on more advanced results like an estimate for the number of rational points on an absolutely irreducible curve over a finite field. Two important theorems on primitive permutation groups are supplied with complete proofs. The book may serve as a reference text for graduate students or researchers interested in algebraic or number theoretic aspects of polynomials and for cryptologists.
Download or read book Algebraic Structures And Number Theory Proceedings Of The First International Symposium written by S P Lam and published by World Scientific. This book was released on 1990-12-31 with total page 346 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this proceedings, recent development on various aspects of algebra and number theory were discussed. A wide range of topics such as group theory, ring theory, semi-group theory, topics on algebraic structures, class numbers, quadratic forms, reciprocity formulae were covered.
Download or read book Finite Fields and Applications written by Gary L. Mullen and published by American Mathematical Soc.. This book was released on 2007 with total page 190 pages. Available in PDF, EPUB and Kindle. Book excerpt: Finite fields Combinatorics Algebraic coding theory Cryptography Background in number theory and abstract algebra Hints for selected exercises References Index.
Download or read book Finite Fields Theory and Computation written by Igor Shparlinski and published by Springer Science & Business Media. This book was released on 2013-03-09 with total page 532 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Counting Polynomial Matrices over Finite Fields written by Julia Lieb and published by BoD – Books on Demand. This book was released on 2017-09-15 with total page 166 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is dealing with three mathematical areas, namely polynomial matrices over finite fields, linear systems and coding theory. Primeness properties of polynomial matrices provide criteria for the reachability and observability of interconnected linear systems. Since time-discrete linear systems over finite fields and convolutional codes are basically the same objects, these results could be transferred to criteria for non-catastrophicity of convolutional codes. In particular, formulas for the number of pairwise coprime polynomials and for the number of mutually left coprime polynomial matrices are calculated. This leads to the probability that a parallel connected linear system is reachable and that a parallel connected convolutional code is non-catastrophic. Moreover, other networks of linear systems and convolutional codes are considered.
Download or read book Handbook of Finite Fields written by Gary L. Mullen and published by CRC Press. This book was released on 2013-06-17 with total page 1048 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
Download or read book A Note on Polynomial Matrix Functions Over a Finite Field written by J. V. Brawley and published by . This book was released on 1977 with total page 8 pages. Available in PDF, EPUB and Kindle. Book excerpt: Let F = GF(q) denote the finite field of order q, and let F(n) denote the ring of n x n matrices over F. This paper obtains a unique representation for and determines the number of right (left) polynomial functions A:F(n) yields F(n).
Download or read book Uniform Distribution of Sequences of Integers in Residue Classes written by W. Narkiewicz and published by Springer. This book was released on 2006-12-08 with total page 133 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Hadamard Matrices written by Jennifer Seberry and published by John Wiley & Sons. This book was released on 2020-08-25 with total page 352 pages. Available in PDF, EPUB and Kindle. Book excerpt: Up-to-date resource on Hadamard matrices Hadamard Matrices: Constructions using Number Theory and Algebra provides students with a discussion of the basic definitions used for Hadamard Matrices as well as more advanced topics in the subject, including: Gauss sums, Jacobi sums and relative Gauss sums Cyclotomic numbers Plug-in matrices, arrays, sequences and M-structure Galois rings and Menon Hadamard differences sets Paley difference sets and Paley type partial difference sets Symmetric Hadamard matrices, skew Hadamard matrices and amicable Hadamard matrices A discussion of asymptotic existence of Hadamard matrices Maximal determinant matrices, embeddability of Hadamard matrices and growth problem for Hadamard matrices The book can be used as a textbook for graduate courses in combinatorics, or as a reference for researchers studying Hadamard matrices. Utilized in the fields of signal processing and design experiments, Hadamard matrices have been used for 150 years, and remain practical today. Hadamard Matrices combines a thorough discussion of the basic concepts underlying the subject matter with more advanced applications that will be of interest to experts in the area.
Download or read book Finite Fields and Their Applications written by Pascale Charpin and published by Walter de Gruyter. This book was released on 2013-05-28 with total page 288 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is based on the invited talks of the "RICAM-Workshop on Finite Fields and Their Applications: Character Sums and Polynomials" held at the Federal Institute for Adult Education (BIfEB) in Strobl, Austria, from September 2-7, 2012. Finite fields play important roles in many application areas such as coding theory, cryptography, Monte Carlo and quasi-Monte Carlo methods, pseudorandom number generation, quantum computing, and wireless communication. In this book we will focus on sequences, character sums, and polynomials over finite fields in view of the above mentioned application areas: Chapters 1 and 2 deal with sequences mainly constructed via characters and analyzed using bounds on character sums. Chapters 3, 5, and 6 deal with polynomials over finite fields. Chapters 4 and 9 consider problems related to coding theory studied via finite geometry and additive combinatorics, respectively. Chapter 7 deals with quasirandom points in view of applications to numerical integration using quasi-Monte Carlo methods and simulation. Chapter 8 studies aspects of iterations of rational functions from which pseudorandom numbers for Monte Carlo methods can be derived. The goal of this book is giving an overview of several recent research directions as well as stimulating research in sequences and polynomials under the unified framework of character theory.
Download or read book Handbook of Algebra written by and published by Elsevier. This book was released on 1995-12-18 with total page 936 pages. Available in PDF, EPUB and Kindle. Book excerpt: Handbook of Algebra defines algebra as consisting of many different ideas, concepts and results. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. Each chapter of the book combines some of the features of both a graduate-level textbook and a research-level survey. This book is divided into eight sections. Section 1A focuses on linear algebra and discusses such concepts as matrix functions and equations and random matrices. Section 1B cover linear dependence and discusses matroids. Section 1D focuses on fields, Galois Theory, and algebraic number theory. Section 1F tackles generalizations of fields and related objects. Section 2A focuses on category theory, including the topos theory and categorical structures. Section 2B discusses homological algebra, cohomology, and cohomological methods in algebra. Section 3A focuses on commutative rings and algebras. Finally, Section 3B focuses on associative rings and algebras. This book will be of interest to mathematicians, logicians, and computer scientists.
Download or read book Algebraic Structures and Number Theory written by S. P. Lam and published by World Scientific Publishing Company. This book was released on 1990 with total page 352 pages. Available in PDF, EPUB and Kindle. Book excerpt: "... First International Symposium on Algebraic Structures and Number Theory held in Hong Kong ... 1988"--Pref.
Download or read book Polynomials Over a Ring which Permute the Matrices Over that Ring written by Joel V Brawley (Jr) and published by . This book was released on 1974 with total page 16 pages. Available in PDF, EPUB and Kindle. Book excerpt: Let R denote a finite commutative ring with identity and let R sub (n x n) denote the nxn matrices over R. Each polynomial f(x) and element of R(in brackets:(x)) defines, via substitution a function from R sub (n x n) to R sub (n x n). In this paper necessary and sufficient conditions are given on a polynomial f(x) in order that it define a permutation of R sub (n x n).
Download or read book Finite Fields written by Rudolf Lidl and published by . This book was released on 1983 with total page 780 pages. Available in PDF, EPUB and Kindle. Book excerpt:
