
Book contents
- Frontmatter
- Contents
- Preface
- Conference Participants
- Factorizations over finite fields
- Class number in totally imaginary extensions of totally real function fields
- Automorphism groups and permutation groups of affine-invariant codes
- A construction of bent functions
- Monodromy groups of classical families over finite fields
- Wan's bound for value sets of polynomials
- Comparative implementations of Berlekamp's and Niederreitor's polynomial factorization algorithms
- On the minimal polynomials for certain Gauss periods over finite fields
- Completely free elements
- Exponential sums over Galois rings and their applications
- Maximal sets of mutually orthogonal Latin squares
- Examples of small hybrid sums
- Cellular automata, substitutions and factorization of polynomials over finite fields
- A new class of two weight codes
- Construction of digital (t, m, s)-nets from linear codes
- A family of exceptional polynomials in characteristic three
- Estimates of character sums arising from finite upper half planes
- Carmichael-Carlitz polynomials and Fermat-Carlitz quotients
- Open problems and conjectures in finite fields
- Quasirandom points and global function fields
- Use characteristic sets to decode cyclic codes up to actual minimum distance
- Approximate constructions in finite fields
- Periodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, II
- Factoring cyclotomic polynomials over large finite fields
- Character sums and coding theory
- L-functions of algebraic varieties over finite fields: rationality, meromorphy and entireness
- Some congruences and identities for generalizations of Rédei functions
Open problems and conjectures in finite fields
Published online by Cambridge University Press: 29 September 2009
- Frontmatter
- Contents
- Preface
- Conference Participants
- Factorizations over finite fields
- Class number in totally imaginary extensions of totally real function fields
- Automorphism groups and permutation groups of affine-invariant codes
- A construction of bent functions
- Monodromy groups of classical families over finite fields
- Wan's bound for value sets of polynomials
- Comparative implementations of Berlekamp's and Niederreitor's polynomial factorization algorithms
- On the minimal polynomials for certain Gauss periods over finite fields
- Completely free elements
- Exponential sums over Galois rings and their applications
- Maximal sets of mutually orthogonal Latin squares
- Examples of small hybrid sums
- Cellular automata, substitutions and factorization of polynomials over finite fields
- A new class of two weight codes
- Construction of digital (t, m, s)-nets from linear codes
- A family of exceptional polynomials in characteristic three
- Estimates of character sums arising from finite upper half planes
- Carmichael-Carlitz polynomials and Fermat-Carlitz quotients
- Open problems and conjectures in finite fields
- Quasirandom points and global function fields
- Use characteristic sets to decode cyclic codes up to actual minimum distance
- Approximate constructions in finite fields
- Periodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, II
- Factoring cyclotomic polynomials over large finite fields
- Character sums and coding theory
- L-functions of algebraic varieties over finite fields: rationality, meromorphy and entireness
- Some congruences and identities for generalizations of Rédei functions
Summary
Abstract
We discuss a number of open problems and conjectures in the theory and application of finite fields. We also provide a brief discussion of the status as well as references related to each problem.
Introduction
In this paper we try to summarise some interesting and/or important questions in the theory and application of finite fields. These questions obviously reflect our personal tastes but we have indeed tried to consider questions of general interest. We hope that these questions and even more, the methods developed for their solutions, will be of interest to other researchers. The reader may wonder why some questions we call ‘Problems’ and some we call ‘Conjectures’. Roughly speaking, we use the term Conjecture if we (and very often others) believe the statement to be true while the term Problem is used to indicate all other statements. In general we feel that our conjectures may be more difficult to resolve than our problems.
The standard notions of the theory of finite fields which we use can be found in the finite field bible by Lidl and Niederreiter.
Combinatorics
There are numerous open problems in combinatorics which are related to finite fields. In this section we briefly describe several of these. We begin with several questions related to latin squares. A latin square of order n is an n × n array based upon n distinct symbols with the property that each row and each column contains each of the n symbols exactly once.
- Type
- Chapter
- Information
- Finite Fields and ApplicationsProceedings of the Third International Conference, Glasgow, July 1995, pp. 243 - 268Publisher: Cambridge University PressPrint publication year: 1996
- 7
- Cited by