Linear Groups of Small Degree over Fields of Finite Characteristic
نویسندگان
چکیده
منابع مشابه
ON THE CHARACTERISTIC DEGREE OF FINITE GROUPS
In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...
متن کاملIrreducible Monomial Linear Groups of Degree Four over Finite Fields
We describe an algorithm for explicitly listing the irreducible monomial subgroups of GL(n, q) , given a suitable list of finite irreducible monomial subgroups of GL(n, C) , where n is 4 or a prime, and q is a prime power. Particular attention is paid to the case n = 4, and the algorithm is illustrated for n = 4 and q = 5. Certain primitive permutation groups can be constructed from a list of i...
متن کاملSmall degree representations of finite Chevalley groups in defining characteristic
We determine for all simple simply connected reductive linear algebraic groups defined over a finite field all irreducible representations in their defining characteristic of degree below some bound. These also give the small degree projective representations in defining characteristic for the corresponding finite simple groups. For large rank l our bound is proportional to l3 and for rank 11 m...
متن کاملNilpotent Primitive Linear Groups over Finite Fields
In this paper we investigate the structure of groups as in the title. Our work builds on work of several other authors, namely Konyuh [5], Leedham-Green and Plesken [6], and Zalesskii [10], who have described the abstract isomorphism types of the groups. We obtain more detailed descriptions, in particular explaining how group structure depends on the existence of an abelian primitive subgroup. ...
متن کاملCounting points on varieties over finite fields of small characteristic
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing the order of the group of rational points on the Jacobian of a smooth geometrically connected projective curve over a finite field of small characteristic. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1993
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1162