2011
DOI: 10.1007/s11856-011-0135-0
|View full text |Cite
|
Sign up to set email alerts
|

Additive polynomials for finite groups of Lie type

Abstract: This paper provides a realization of all classical finite groups of Lie type as well as a number of exceptional ones (with low-dimensional representations) as Galois groups over function fields over Fq and derives explicit additive polynomials for the extensions. Our unified approach is based on results of Matzat which give bounds for Galois groups of Frobenius modules and uses the structure and representation theory of the corresponding connected linear algebraic groups.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 22 publications
0
13
0
Order By: Relevance
“…is a set of strong generators (for the definition of strong generators, see [1] Section 3.4) (b) if B ∈ GL n (L), and (L n , Φ B ) has Galois group G(F q ), then B is Frobenius equivalent to A(ξ), for some ξ ∈ L d then G(F q ) admits a generic polynomial in d parameters over F q .…”
Section: Generic Polynomials and Generic Extensionsmentioning
confidence: 99%
See 1 more Smart Citation
“…is a set of strong generators (for the definition of strong generators, see [1] Section 3.4) (b) if B ∈ GL n (L), and (L n , Φ B ) has Galois group G(F q ), then B is Frobenius equivalent to A(ξ), for some ξ ∈ L d then G(F q ) admits a generic polynomial in d parameters over F q .…”
Section: Generic Polynomials and Generic Extensionsmentioning
confidence: 99%
“…We use the special case of the Lower Bound Theorem as stated in the Albert-Maier paper [2,Theorem 3.4].…”
mentioning
confidence: 99%
“…Most of the material in Sections 2.1-2.3 can be found in [9, Part I], [2]. We include it here for the convenience of the reader.…”
Section: Frobenius Modulesmentioning
confidence: 99%
“…Let v = (1, 0, 1) T ∈ F 3 2 . The matrix N = v|Av (2) |AA (2) v (4) is nonsingular, so v is indeed a generator. As before, we compute Δ = N −1 AN (2) .…”
Section: Examplesmentioning
confidence: 99%
See 1 more Smart Citation