Automorphisms and isomorphisms of symmetric and affine designs (Q1330171)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automorphisms and isomorphisms of symmetric and affine designs |
scientific article |
Statements
Automorphisms and isomorphisms of symmetric and affine designs (English)
0 references
23 August 1994
0 references
New results are given on the representation of finite groups as the automorphism groups of combinatorial structures. According to the author's introduction, many theorems of the form ``every finite group is the full automorphism group of a member of a certain class of combinatorial structures'' have been proved, particularly for graphs or Steiner triple systems. The purpose of this paper is ``to prove such a theorem for structures that appear to be a bit more constrained: symmetric designs''. More precisely, the main result of this paper states that given a finite group \(G\) there exist symmetric designs and affine designs having the same parameters as \(\text{PG}(d,q)\) or \(\text{AG}(d,q)\), respectively, for all \(d\geq 50| G|^ 2\) and for each power prime \(q>3\). The proof of this theorem uses results concerning permutations of the points of projective spaces that have been summarized in the final section. A separate section summarizing numerous remarks and conjectures suggested by various results obtained and used in the course of the proof is included, as well.
0 references
representation of finite groups
0 references
automorphism groups
0 references
Steiner triple systems
0 references
symmetric designs
0 references
affine designs
0 references
permutations
0 references
projective spaces
0 references