Affine distance-transitive groups of dimension one (Q1971801): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How many P-polynomial structures can an association scheme have? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine Distance-Transitive Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine distance-transitive graphs: The cross characteristic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable, flag-transitive, rank 3 collineation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Affine Permutation Groups of Rank Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine distance-transitive groups with alternating or symmetric point stabiliser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations over finite fields. An elementary approach / rank
 
Normal rank

Latest revision as of 13:59, 29 May 2024

scientific article
Language Label Description Also known as
English
Affine distance-transitive groups of dimension one
scientific article

    Statements

    Affine distance-transitive groups of dimension one (English)
    0 references
    0 references
    0 references
    13 December 2000
    0 references
    \(V\) is an \(n\)-dimensional vector space over \(\text{F}_q\) and \(G\) is a subgroup in \(\text{A}\Gamma\text{L}(v)\cong \text{A}\Gamma\text{L}(n, q)\) containing all translations with \(G_0\subseteq G\) the stabilizer of the zero vector. Hypothesis DTG says that \(\Gamma\) is a graph structure on \(V\) of diameter \(d\) such that \(G\) acts primitively and distance-transitively on \(\Gamma\). By \textit{J. van Bon} [Affine distance-transitive groups, Proc. Lond. Math. Soc., III. Ser. 67, No. 1, 1-52 (1993; Zbl 0795.05074)] this hypothesis implies at least one of three cases. The authors describe the case \(n=1\) for \(d\geq 3\). (The cases \(d= 1, 2\) are in the literature.) The conclusion reads: \(q= 64\), \(G_0\cong Z_9: Z_3\) or \(Z_9: Z_6\), and \(\Gamma\) is the Hamming graph \(H(4,3)\) of diameter \(3\).
    0 references
    vector space
    0 references
    stabilizer
    0 references
    Hamming graph
    0 references

    Identifiers