The L 3 (4) near octagon

Size: px
Start display at page:

Download "The L 3 (4) near octagon"

Transcription

1 The L 3 (4) near octagon A. Bishnoi and B. De Bruyn October 8, 206 Abstract In recent work we constructed two new near octagons, one related to the finite simple group G 2 (4) and another one as a sub-near-octagon of the former. In the present paper, we give a direct construction of this sub-near-octagon using a split extension of the group L 3 (4). We derive several geometric properties of this L 3 (4) near octagon, and determine its full automorphism group. We also prove that the L 3 (4) near octagon is closely related to the second subconstituent of the distanceregular graph on 486 vertices discovered by Soicher in 993. Keywords: near polygon, generalized polygon, commuting involutions, distance-regular graph, finite simple group MSC200: 05E8, 5E2, 5E25 Introduction The main goal of this paper is to give a new construction of the near octagon of order (2, 4) that was discovered by us in [], and to derive some geometric and group theoretic properties of this near octagon that were not explored earlier. In doing so, we introduce a family of near polygons to which this new near octagon belongs and study some common properties that the members of this family have. This also gives an alternate treatment of some of the results in [, Section 4.]. We emphasize that we have singled out a few combinatorial properties of the collinearity graph (properties (P), (P2), (P3), (P4) in Section 4) that allows us to derive all the remaining properties. A connected partial linear space S = (P, L, I) with nonempty point set P, line set L and incidence relation I P L is called a near polygon if for every point x and every line L, there exists a unique point on L nearest to x. Here, distances are measured in the collinearity graph Γ. If d is the diameter of Γ, then the near polygon is called a near 2dgon. A near polygon is said to have order (s, t) if every line is incident with precisely s+ points and every point is incident with exactly t + lines. For other relevant definitions see Section 2. In [], we constructed a new near octagon related to the simple group G 2 (4). Among other things, we proved the following.

2 Proposition. (a) Let O be the point-line geometry whose points are the 4095 central involutions of the group G = G 2 (4):2 and whose lines are all the three element subsets {x, y, xy} where x and y are two commuting central involutions that satisfy [G : N G ( x, y )] {365, 3650}, with incidence being containment. Then O is a near octagon of order (2, 0). (b) Let S denote the set of all lines {x, y, xy} where x and y are two commuting central involutions of G that satisfy [G : N G ( x, y )] = 365. Then S is a line spread of O. If Q denotes the set of all quads of O, then for every Q Q the lines of S contained in Q define a line spread of Q. Moreover, the point-line geometry S with point set S, line set Q and the natural incidence is a generalized hexagon isomorphic to the dual split Cayley hexagon H(4) D. In [], we also constructed a sub-near-octagon of O corresponding to each subhexagon of order (4, ) of S = H(4) D. These (isomorphic) near octagons had order (2, 4) and they turned out to be new as well. We now give an alternate direct construction of this near octagon of order (2, 4) using the finite simple group PSL 3 (4) = L 3 (4). The group Aut(L 3 (4)) = L 3 (4):D 2 has a unique conjugacy class of subgroups of type L 3 (4):2 2, and we denote by L 3 (4):2 2 any isomorphic copy of such a subgroup. Theorem.2 (a) Let O 2 be the point-line geometry whose points are the 35 central involutions of the group G 2 = L 3 (4):2 2 and whose lines are all the three element subsets {x, y, xy} where x and y are two commuting central involutions that satisfy [G 2 : N G2 ( x, y )] {05, 420}, with incidence being containment. Then O 2 is a near octagon of order (2, 4). (b) Let S 2 denote the set of all lines {x, y, xy} where x and y are two commuting central involutions of G 2 that satisfy [G 2 : N G2 ( x, y )] = 05. Then S 2 is a line spread of O 2. If Q 2 denotes the set of all quads of O 2, then for every Q Q 2 the lines of S 2 contained in Q define a line spread of Q. Moreover, the point-line geometry S 2 with point set S 2, line set Q 2 and natural incidence is isomorphic to the unique generalized hexagon H(4, ) of order (4, ). We will refer to the near octagons O and O 2 as the G 2 (4) near octagon and the L 3 (4) near octagon, respectively. We note that the central involutions of L 3 (4):2 2 are precisely the central involutions of its derived subgroup L 3 (4), and these are precisely the nontrivial elations of the projective plane PG(2, 4) on which the group L 3 (4) acts naturally. Part (a) of Theorem.2 will be proved in Section 3. The structure of the near octagons O and O 2 around a fixed point can be described by a diagram, see [, Figure ] for the G 2 (4) near octagon and Figure of the present paper for the L 3 (4) near octagon. These two diagrams are very similar and Section 4 is devoted to the study of the geometric properties of a family of near octagons whose local structures can be described by such This group is isomorphic to the automorphism group of G 2 (4). 2

3 diagrams. Part (b) of Theorem.2 will follow from that discussion. We also note that Part (b) of Proposition. (with the exception of the isomorphism S = H(4) D ) also follows from the results of Section 4. At this moment, we do not know whether the G 2 (4) and L 3 (4) near octagons are the only nontrivial members of the family of near octagons under consideration in Section 4. In Section 5, we determine the full automorphism group of the near octagon O 2. Theorem.3 We have Aut(O 2 ) = L 3 (4) : 2 2, and the automorphisms of O 2 are precisely the conjugations by elements of L 3 (4):2 2. In [], Soicher constructed a distance-transitive graph Υ of diameter 4, which is a distance-regular graph with intersection array {b 0, b, b 2, b 3 ; c, c 2, c 3, c 4 } = {56, 45, 6, ;, 8, 45, 56}. Let G be the automorphism group of this graph Υ. By [], we know that if x is a vertex of Υ, then the stabilizer G x of G with respect to x is isomorphic to L 3 (4):2 2. Let O 2 (x) denote the near octagon defined on the central involutions of G x = L3 (4):2 2 (in the sense of Theorem.2). If x is a vertex of Υ, then by [], we also know that Υ 2 (x) = 35 and that the local graph Υ x is isomorphic to the well-known Gewirtz graph, which is the unique strongly regular graph with parameters (v, k, λ, µ) = (56, 0, 0, 2) [4]. We show in Section 6 that the second subconstituent of Υ is closely related to the L 3 (4) near octagon. Among other things, we prove the following there. Theorem.4 Let x be a vertex of Υ. Then the following hold: () For every vertex y Υ 2 (x), the element-wise stabilizer of Υ (x) Υ (y) inside G x has order 2 and is generated by a central involution σ y of G x = L3 (4):2 2. Moreover, the map θ : y σ y defines a bijection between Υ 2 (x) and the set of central involutions of G x. (2) Let Γ denote the graph defined on the set Υ 2 (x) of vertices at distance 2 from x in Υ, by making two vertices y, y 2 adjacent if and only if d(y, y 2 ) = 4 or (d(y, y 2 ) = 2 and Υ (x) Υ (y ) Υ (y 2 ) = 4). Then the map θ is an isomorphism between Γ and the collinearity graph of O 2 (x). (3) The map θ also defines an isomorphism between the subgraph of Υ induced on Υ 2 (x) (the second subconstituent) and the graph obtained from the collinearity graph of O 2 (x) by making two vertices (points of the near octagon) adjacent when they are at distance 2 from each other and have a unique common neighbour. 2 It is known that the second subconstituent of the Hall-Janko graph (which is a strongly regular graph srg(00, 36, 4, 2)) is isomorphic to the distance-2 graph of the dual split 2 This graph is also a distance-regular graph, and recently Soicher [2] has proved that it is the unique distance-regular graph with intersection array {32, 27, 8, ;, 4, 27, 32}. 3

4 Cayley hexagon H(2) D, and that the second subconstituent of the G 2 (4)-graph (which is an srg(46, 00, 36, 20)) is isomorphic to the distance-2 graph of the Hall-Janko near octagon. One of the referees of an earlier paper of ours [2] informed us that there is also a close connection between the G 2 (4) near octagon O and the second subconstituent of the distance-regular graph with intersection array {46, 35, 64, ;, 32, 35, 46} discovered by Soicher [] (see [2, Remark.4]) We elaborate on this in the appendix of the present paper where we prove a similar result as Theorem.4 for the G 2 (4) near octagon. 2 Preliminaries We first review some of the basics from the theory of near polygons that will be used in this paper. For more details see the standard reference [7]. Recall that a point-line geometry S = (P, L, I) is called a near 2d-gon if it is a partial linear space with collinearity graph of diameter d and the property that for every x P and every L L there exists a unique point on L that is nearest to x. Let S = (P, L, I) be a near 2d-gon. Then by [5, Lemma ], only one of the following possibilities occur for two lines L and L 2 in S: there exists a unique point x L and a unique point x 2 L 2 such that for all y L and y 2 L 2, we have d(y, y 2 ) = d(y, x ) + d(x, x 2 ) + d(x 2, y 2 ); for every point y L, there exists a unique point y 2 L 2 such that d(y, y 2 ) = d(l, L 2 ) and conversely for every z 2 L 2 there exists a unique point z L such that d(z, z 2 ) = d(l, L 2 ). If the latter case occurs, then we say that the lines L and L 2 are parallel. A subset S of L is called a line spread if for every point x, there exists a unique L S such that x L. A subset X of P is called a subspace if for every two collinear points x, y in X, all points on the line xy of S are contained in X. For a nonempty subspace X of S, we will denote by X the point-line geometry formed by taking the points of X and those lines of S which are completely contained in X. A subspace X is called convex if for every pair of points x, y in X every point on every shortest path between x and y in S is also contained in X. A convex subspace Q of P is called a quad of S if Q is a non-degenerate generalized quadrangle (see [9] for the definition and basic properties of generalized quadrangles). From [0, Proposition 2.5], it follows that if S has at least three points on each line (which will be the case for all near polygons considered in this paper), then for every two points x, y in S at distance 2 from each other which have more than one common neighbour, there exists a unique quad containing x and y. From this it also follows that through a pair of intersecting lines in S there can be at most one quad. If every line of S has s+ 3 points on it, and a pair of points at distance 2 have α + 2 common neighbours, then the generalized quadrangle corresponding to the unique quad through these points has order (s, α). From [0, Proposition 2.6], one of the following cases occurs for a point-quad pair (x, Q) in S: 4

5 there exists a unique point x Q such that for every y Q we have d(x, y) = d(x, x ) + d(x, y); the points in Q nearest to x form an ovoid of the corresponding generalized quadrangle Q, i.e., a set of points of Q meeting every line of Q in a singleton. In the former case we say that the point x is classical with respect to Q and the point x is denoted by π Q (x). In the latter case, we say that x is ovoidal with respect to Q. If d(x, Q), then it is easy to show that x is always classical with respect to Q. We follow the group theoretical notation of Atlas [6]. An involution σ of a group G is called central if there exists a Sylow-2 subgroup H of G such that σ lies in the centralizer C G (H). We describe here a model of the group L 3 (4):2 2 which will be useful. Let V be a 3-dimensional vector space over the field F 4 with basis (ē, ē 2, ē 3 ), and denote by ( f, f 2, f 3 ) the dual basis of the dual space V. The annihilator of a -space of V is a 2-space of V, implying that we can identify each line of PG(V ) with a point of PG(V ). With each collineation θ P ΓL(V ) of the projective space PG(V ), there is associated a nonsingular 3 3 matrix A over F 4 and an automorphism τ of F 4 such that the point x ē +x 2 ē 2 +x 3 ē 3 of PG(V ) is mapped to the point x ē +x 2ē 2 +x 3ē 3 of PG(V ), where [x x 2 x 3] T = A [x τ x τ 2 x τ 3] T. While the automorphism τ of F 4 is uniquely determined by θ, the matrix A itself is only determined up to a nonzero factor. However, all matrices A corresponding to θ have the same determinant as k 3 = for every k F 4 \ {0}. The element θ of P ΓL(V ) also permutes the lines of PG(V ). Specifically, if the line y f + y 2 f2 + y 3 f3 is mapped to the line y f + y 2 f 2 + y 3 f 3, then [y y 2 y 3] T = (A T ) [y τ y2 τ y3] τ T. With each correlation θ of PG(V ), there is also associated a nonsingular 3 3 matrix A over F 4 and an automorphism τ of F 4 such that the point x ē + x 2 ē 2 + x 3 ē 3 is mapped to the line y f + y 2 f 2 + y 3 f 3, where [y y 2 y 3] T = A [x τ x τ 2 x τ 3] T. Again, the automorphism τ of F 4 is uniquely determined by θ, but A is only determined up to a nonzero factor. If A and τ are as above, then θ will map the line y f + y 2 f2 + y 3 f3 to the point x ē + x 2ē 2 + x 3ē 3, where [x x 2 x 3] T = (A T ) [y τ y2 τ y3] τ T. Let G = P SL3 (4) = L 3 (4) denote the group of all collineations of PG(V ) for which τ = and for which det(a) =, 3 let G 2 denote the group of all collineations of PG(V ) for which det(a) = and let G denote the group of all collineations and correlations of PG(V ) for which det(a) =. Then G has index 2 in G 2 which itself has index 2 in G. If G 3 denotes the set of all elements of G for which A = I 3, then G 3 = C2 C 2 and G is the internal semidirect product G G 3. So, G is a group of type L 3 (4):2 2. Note also that G is the derived subgroup of G, and that the group of all collineations and correlations of PG(V ) has type L 3 (4):D 2. The group G has a natural action on the set F of 05 flags of PG(V ), i.e., the edges of the incidence graph of the projective plane PG(V ). This action is transitive and there are same. 3 This is well-defined. There are different choices possible for A, but the determinants are always the 5

6 four orbitals, implying that the group G acts distance-transitively on the point set of the unique generalized hexagon H(4, ) of order (4, ). This is the generalized hexagon whose points are the elements of F and whose lines are the points and lines of PG(V ), with incidence being reverse containment. The fact that G acts distance-transitively implies that G must also act primitively on the set of 05 points of H(4, ). Consulting GAP s library of primitive permutation groups [8], we see that there exists a unique primitive permutation group on 05 letters that has type L 3 (4):2 2. We have used the implementation of this group in GAP to verify several claims in this paper (see [3]). 3 The L 3 (4) near octagon Let G = L 3 (4):2 2 be the group of all collineations and correlations of PG(2, 4) whose corresponding matrix has determinant, as described in Section 2. Let P denote the set of all 35 central involutions of G (Type 2A in Atlas notations [6]). These 35 central involutions are all contained in G = G = L3 (4) and correspond to the 35 nontrivial elations of the projective plane PG(2, 4). The group G acts on P by conjugation. Let ω denote a fixed central involution of G. Then it is easily checked using GAP that the stabilizer G ω of ω has eight orbits on P, the so-called suborbits of G with respect to ω. Such a suborbit will be denoted by O 0, O a, O b, O 2a, O 2b, O 3a, O 3b and O 4 in accordance with the information provided by the following table: Suborbit O 0 O a O b O 2a O 2b O 3a O 3b O 4 Size x, ω C 2 C 2 C 2 C 2 C 2 C 2 C 2 D 8 D 8 S 3 D 0 In the table, we have mentioned the sizes of the suborbits and descriptions for the groups x, ω, where x is an arbitrary element of the considered suborbit. The suborbits with respect to a fixed central involution y will be denoted by O 0 (y), O a (y),..., O 4 (y). The central involutions distinct from ω which commute with ω are those of the set O a O b O 2a. Moreover, if O {O a, O b, O 2a } and x O, then ωx O. The sets O a, O b and O 2a consist of those central involutions x ω for which [G : N G ( x, ω )] has size 05, 420 and 840, respectively. Let L denote the set of all triples {x, y, xy}, where x and y are two distinct commuting central involutions such that [G : N G ( x, y )] has size 05 or 420, and let O 2 be the pointline geometry with point set P and line set L, where incidence is containment. With GAP ([3], similar code as in []), we have computed the suborbit diagram for the central involutions of L 3 (4):2 2. This suborbit diagram can be found in Figure. Each of the eight big nodes of the diagram denotes a suborbit and an edge between two such nodes denotes that there is a line of O 2 that intersects both suborbits. A smaller node on each edge denotes a line and the two numbers on the node denote the number of points of the line that lie in each suborbit it intersects. The numbers on each big node are the number of lines through a representative of the suborbit meeting the adjacent suborbits. 6

7 O 0 4 O a O 2a O 3a O O b O 2b 3 2 O 3b Figure : The suborbit diagram for the central involutions of L 3 (4):2 2 Theorem 3. O 2 is a near octagon of order (2, 4). Proof. Let x be an arbitrary point of O 2. For i N denote by Γ i (x), the set of points at distance i from x. Considering the suborbit diagram with respect to x, we see that: There are five lines through x. Γ (x) = O a (x) O b (x), Γ 2 (x) = O 2a (x) O 2b (x), Γ 3 (x) = O 3a (x) O 3b (x) and Γ 4 (x) = O 4 (x). Every line contains a unique point nearest to x. So, O 2 must be a near octagon of order (2, 4). For every point x of O 2, let L x denote the unique line through x containing the two points of O a (x). Let S 2 denote the set of all lines of the form L x, where x P, and let Q denote the set of all quads of O 2. Lemma 3.2 For every point x of O 2, there are precisely two quads through x and these two quads intersect in the line L x. Proof. We will rely on the information provided by the suborbit diagram. If y O 2b (x), then x and y have precisely one neighbour and so they cannot be contained in a common quad. If y O 2a (x), then x and y have precisely three common neighbours one of which is contained on the line L x, implying that x and y are contained in a unique quad of order (2, 2) (necessarily isomorphic to W (2) [9, 5.2.3]) and this quad contains the line L x. Every point z O b (x) is collinear with a point of O 2a (x), implying that the line xz is contained in a quad. This quad must be unique as it also contains the line L x. As there 7

8 are four lines through x distinct from L x, there are precisely 4 = 2 quads through x, and 2 these two quads necessarily intersect in the line L x. The following is an immediate consequence of Lemma 3.2. Corollary 3.3 two quads. () The lines of S 2 are precisely the lines of O 2 that are contained in (2) The set S 2 is a line spread of O 2. In the following theorem, we show that there exists a full embedding of O 2 into O. In [], we constructed near octagons of order (2, 4) as subgeometries of O. In Section 4, we explain why all these near octagons of order (2, 4) are isomorphic to the L 3 (4) near octagon O 2. Theorem 3.4 There exists a full embedding of O 2 into O mapping lines of S 2 to lines of S. Two embedded points are collinear in O if and only if they are collinear in O 2. Proof. By the Atlas [6] (also see [4, Section 4.3.6]), the group G := G 2 (4):2 has a maximal subgroup H of type SL(3, 4):2 2. If we regard G as naturally acting on the dual split Cayley hexagon H(4) D, then H is the stabilizer of a subhexagon of order (4, ). Let Z := Z(H ) be the center of the derived subgroup H = SL(3, 4) of H. Then Z = C3, J := H/Z = L 3 (4):2 2 and J = H /Z = L 3 (4). If x H = SL(3, 4) : 2 2, then x denotes the element xz of H/Z = L 3 (4):2 2. There exists a bijective correspondence between the involutions of the group H = SL(3, 4) and the involutions of the group J = H /Z = L 3 (4). If σ is an involution of H, then σ Z = C 3 and so σ = σz is an involution of J = H /Z = L 3 (4). Conversely, if τz is an involution of J = H /Z = L 3 (4), there exists a unique involution σ of H for which σ = τz. Now, denote by Σ the set of all involutions of H for which Σ := {σ σ Σ} is the set of all central involutions of J = H /Z = L 3 (4). Then Σ is a conjugacy class of involutions of both H and H. If σ Σ and x H, then x σx = x σ x Σ as x H/Z = L 3 (4):2 2 and σ Σ and hence the involution x σx belongs to Σ. As Σ is a conjugacy class of involutions of H and H, it is contained in a conjugacy class of involutions of G = G 2 (4):2. We have verified with GAP (see [3]) that all elements of Σ are central involutions of G = G 2 (4):2. Since x σx = x σ x for all σ Σ and all x H = SL(3, 4) : 2 2, the action of H = SL(3, 4) : 2 2 on the set Σ gives rise to the same suborbit diagram as the action of H/Z = L 3 (4):2 2 on Σ (which was depicted in Figure ). We suppose that O 2 is the near octagon of order (2, 4) defined on the involutions of the set Σ, where two distinct involutions σ and σ 2 of Σ are collinear whenever the suborbit with respect to σ that contains σ 2 has size 2 or 8. We suppose that O is the near octagon of order (2, 0) defined on the central involutions of G = G 2 (4):2. Since all elements of Σ are central involutions of G 2 (4):2, we have identified each point of O 2 with a point of O. Now, fix a certain ω Σ. We denote by O 0, O a, O b, O 2a, O 2b, O 3a, O 3b, O 4 the suborbits with respect to ω for the action of H on Σ (using the same notational convention 8

9 as before). By [], we know that the action of G = G 2 (4):2 on the set of central involutions gives rise to a similar suborbit diagram as in Figure (but with different numbers). We denote by O 0, O a, O b, O 2a, O 2b, O 3a, O 3b, O 4 the suborbits with respect to ω (using the same notational convention as in []). With the aid of GAP (see [3]), we have verified that every O {O 0, O a, O b, O 2a, O 2b, O 3a, O 3b, O 4 } is contained in O. We know that the suborbits O a and O b contain those points of O 2 that are at distance from ω (in O 2 ). By [], we know that the suborbits O a and O b contain those points of O that are at distance from ω (in O ). So, if x and y are two points of O 2, then x and y are collinear in O 2 if and only if x and y are collinear in O. Every line of O 2 is thus a collection of three mutually collinear points of O, i.e. is a line of O. The unique line of S 2 through ω is {ω} O a, while the unique line of S containing ω is {ω} O a. As O a = O a, every line of S 2 is also a line of S. 4 A family of near octagons Suppose S = (P, L, I) is a finite near octagon of order (s, t), s 2, and S is a line spread of S. For every x P, let L x denote the unique line of the line spread S containing x. For every two points x and y of S, d(x, y) denotes the distance between x and y in the collinearity graph Γ of S and Γ i (x) with i {0,, 2, 3, 4} denotes the set of points at distance i from x. We define a number of additional sets of points of S. For every point x of S, we define Γ (x) := L x \ {x} and Γ (x) := Γ (x) \ Γ (x). For every point x of S and every i {2, 3}, Γ i(x) denotes the set of points of Γ i (x) that are collinear with a point of Γ i (x), and we put Γ i (x) := Γ i (x) \ Γ i(x). Throughout this section, we assume that there exists a positive divisor t t of t such that the following hold for every point x of S: (P) Every point of Γ 2(x) is incident with t lines meeting Γ (x). (P2) Every point of Γ 2(x) is incident with a unique line meeting Γ (x). (P3) Every point of Γ 3(x) is incident with t lines meeting Γ 2(x). (P4) Every point of Γ 3(x) is incident with t t lines meeting Γ 2(x). From the suborbit diagram [, Figure ], it follows that the G 2 (4) near octagon O is an example of such a near octagon with s = 2, t = 0 and t = 2, and from Figure it follows that the L 3 (4) near octagon O 2 is another example with s = 2, t = 4 and t = 2. When t =, we will show at the end of this section that S must be the direct product of a generalized hexagon of order (s, t ) and a line of size s +. We call this a trivial example. We do not know whether the above family of near octagons contains nontrivial examples besides O and O 2. 9

10 In the lemmas below, x denotes some fixed point of S. A point y of S is said to be of type i {0,, 2, 3, 4} if y Γ i (x). A point y of S is said to be of type i or i, for i {, 2, 3}, if it belongs to Γ i(x) or Γ i (x), respectively. A line L of S is said to have type (i, i 2 ) with i, i 2 {0,,,, 2, 2, 2, 3, 3, 3, 4} if L contains a unique point of type i and s points of type i 2. The following lemma follows from easy counting. Lemma 4. We have Γ 0 (x) =, Γ (x) = s and Γ (x) = st. There is a unique line of type (0, ), namely L x, and every line of the line spread S meeting Γ 0 (x) Γ (x) coincides with L x. The point x is contained in a unique line of type (0, ) and t lines of type (0, ). Lemma 4.2 Every point y Γ 2(x) is contained in a (necessarily unique) quad together with x. This quad has order (s, t ). Proof. By definition of the set Γ 2(x), the line L x = {x} Γ (x) contains a (necessarily unique) point collinear with y. By Property (P), there are exactly t points in Γ (x) collinear with y. As the points x and y have t + 2 common neighbours, they are contained in a unique quad, necessarily of order (s, t ). Lemma 4.3 There does not exist any y Γ 2(x) which is contained in a quad together with x. Proof. By Property (P2), there is a unique line through y meeting Γ (x), and by definition of the set Γ 2(x), there are no lines through y meeting Γ (x). Hence, x and y have a unique common neighbour, implying that they cannot be contained in a quad. Lemma 4.4 Every quad through a point y of S contains the line L y. Proof. Without loss of generality, we may take y = x. Suppose Q is a quad through x not containing the line L x. Then no y Γ 2 (x) Q is collinear with a point of L x as otherwise L x would be contained in Q. This implies that Γ 2 (x) Q Γ 2(x), which contradicts Lemma 4.3. Lemma 4.5 For every quad Q of S, the lines of S contained in Q define a line spread of the corresponding generalized quadrangle Q. Proof. If this were not the case, then there would exist a line of S meeting Q in a single point, which would contradict Lemma 4.4. Lemma 4.6 Through every point y Γ (x), there is a unique line of type (0, ) and t lines of type (, 2 ). Proof. By the definition of the set Γ 2(x), every line through y distinct from L x = xy must have type (, 2 ). Lemma 4.7 We have Γ 2(x) = s 2 t. 0

11 Proof. By Lemmas 4. and 4.6, the number of edges between Γ (x) and Γ 2(x) is equal to Γ (x) t s = s 2 t. As any point of Γ 2(x) is collinear with a unique point of L x, we see that Γ 2(x) = s 2 t. Lemma 4.8 There are precisely t t quads through any given point of S. Proof. Without loss of generality, we prove this for the point x. By Lemmas 4.2 and 4.3, every quad through x has order (s, t ) and contains s 2 t points at distance 2 from x which all belong to Γ 2(x). From Lemmas 4.2 and 4.7, it then follows that there are precisely Γ 2 (x) s 2 t = s2 t s 2 t = t t quads through x. Lemma 4.9 Every line M through a point y of S distinct from L y is contained in a unique quad. This quad also contains the line L y. Proof. Without loss of generality, we may suppose that y = x. As any quad through x contains the line L x (Lemma 4.4), there is at most one quad through M. Since every quad through x has order (s, t ), the t quads through x cover t t = t lines through x t t distinct from L x. As these are all lines through x distinct from L x, M must be contained in a unique quad. Lemma 4.0 For every y Γ (x), the line L y has type (, 2 ). For every z Γ 2(x), the line L z has type (, 2 ). Proof. By Lemma 4.9, the line xy is contained in a unique quad Q. By Lemma 4.5, L x and L y are two disjoint lines contained in Q, and so every point of L y \ {y} belongs to Γ 2(x), as it is collinear with a point of L x \ {x} = Γ (x). Therefore, L y has type (, 2 ). The st mutually distinct lines L y with y Γ (x) cover s 2 t points of Γ 2(x). By Lemma 4.7, these are all the points of Γ 2(x). So, for every z Γ 2(x), we also know that the line L z has type (, 2 ). Lemma 4. Let y Γ (x). Then y is contained in a unique line of type (0, ), t lines of type (, 2 ) and t t lines of type (, 2 ). Proof. There is a unique line through y containing x, namely the line xy, and this line contains precisely s points of Γ (x). Every line through y distinct from xy contains a unique point collinear with x (namely y) and hence precisely s points of Γ 2 (x). By Lemma 4.9, there is a unique quad Q (of order (s, t )) through the line xy. By Lemma 4.3, the t lines of Q through y distinct from xy all contain precisely s points of Γ 2(x). Conversely, suppose that L is a line through y containing a point u Γ 2(x). The unique quad through x and u is a convex subspace and contains therefore the lines L = yu and xy, implying that this quad coincides with Q. So, L is one of the t lines of Q through y distinct from xy. The remaining t t lines through y must be of type (, 2 ). Lemma 4.2 We have Γ 2(x) = s 2 t(t t ).

12 Proof. By Lemmas 4. and 4., the number of edges between Γ (x) and Γ 2(x) is equal to Γ (x) (t t )s = s 2 t(t t ). By Property (P2), we know that the number of edges is also equal to Γ 2(x). Lemma 4.3 Let y Γ 2(x). Then y is incident with a unique line of type (, 2 ), t lines of type (, 2 ) and t t lines of type (2, 3 ). Proof. The lines through y meeting Γ (x) (necessarily in a unique point) are precisely the t + lines through y that are contained in the unique quad Q (of order (s, t )) through x and y. By Lemma 4.3, each of these lines contains precisely s points of Γ 2(x) and hence they have type (, 2 ) or (, 2 ). Note also that there is a unique line through y meeting L x = {x} Γ (x), which is the unique line of type (, 2 ) through y. By definition of the set Γ 3(x), the remaining t t lines through y all contain s points of Γ 3(x) and thus have type (2, 3 ). Lemma 4.4 Through every point y Γ 3(x), there is a unique line meeting Γ 2(x). Proof. By definition of the set Γ 3(x), we know that there is at least one such a line. Suppose two lines through y meet Γ 2(x) in the respective points u and u 2. The point u i with i {, 2} is collinear with a unique point v i L x. This point necessarily coincides with the unique point v of L x at distance 2 from y, i.e., v = v = v 2. Since the points y and v have two distinct neighbours, namely u and u 2, they are contained in a unique quad Q. The line L x meets this quad Q in a unique point (namely v), but this contradicts Lemma 4.5. Lemma 4.5 We have Γ 3(x) = s 3 t(t t ). Proof. By Lemmas 4.7 and 4.3, the number of edges between Γ 2(x) and Γ 3(x) is equal to Γ 2(x) (t t )s = s 3 t(t t ). By Lemma 4.4, the number of these edges is also equal to Γ 3(x). Lemma 4.6 For every y Γ 2(x), the line L y has type (2, 3 ). For every z Γ 3(x), the line L z has type (2, 3 ). Proof. By Property (P2), there exists a unique point u Γ (x) collinear with y. By Lemma 4.0, the line L u has type (, 2 ) and so is distinct from uy. By Lemma 4.9, there is a unique quad Q through L u and uy. By Lemma 4.5, this quad also contains the line L y. By Lemma 4.3, Q cannot contain x. So, x lies at distance from Q and is classical with respect to Q, implying that L y \ {y} Γ 3 (x). The lines L y and L u of Q are parallel and at distance. Hence, every point of L y \ {y} is collinear with a point of L u \ {u} Γ 2(x), implying that L y \ {y} Γ 3(x). So, L y has type (2, 3 ). The s 2 t(t t ) lines L y with y Γ 2(x) all have type (2, 3 ) and are mutually disjoint, implying that they cover s 3 t(t t ) points of Γ 3(x). By Lemma 4.5, these are all the points of Γ 3(x), and so the second claim of the lemma should be true as well. Lemma 4.7 For any y Γ 3(x) Γ 4 (x), the line L y has type (3, 4). 2

13 Proof. This follows from Lemmas 4., 4.0, 4.6 and the fact that S is a line spread of S. Lemma 4.8 There are no lines meeting Γ 3(x) and Γ 3(x). Proof. Suppose L is a line containing points u Γ 3(x) and u Γ 3(x), and let y denote the unique point of Γ 2 (x) on L. By the definition of Γ 3(x), we must have y Γ 2(x). By Lemma 4.4, the point u is collinear with a unique point v Γ 2(x). By Lemma 4.0, the line L v meets Γ (x) and so is distinct from vu. By Lemma 4.9, there exists a unique quad Q through L v and vu. This quad contains a point of Γ (x), and so the t lines of Q through u Γ 3(x) distinct from vu all meet Γ 2 (x). By Lemma 4.4, we know that these t lines meet Γ 2(x). By Property (P3), we know that these are all the lines through u meeting Γ 2(x). So, the line L is one of these lines and hence contained in Q. But then every point of L \ {y} is collinear with a point of L v \ Γ (x) Γ 2(x), implying that each point of L \ {y} belongs to Γ 3(x). This contradicts the fact that u Γ 3(x). The following is a consequence of Lemmas 4., 4.6, 4.0, 4., 4.3, 4.6, 4.7 and 4.8. Corollary 4.9 Every line of S has type (0, ), (0, ), (, 2 ), (, 2 ), (, 2 ), (2, 3 ), (2, 3 ), (2, 3 ), (3, 4) or (3, 4). Every line of the line spread S has type (0, ), (, 2 ), (2, 3 ) or (3, 4). We can now draw a diagram for S which looks similar to Figure. This is done in Figure 2, though we still need to prove some numerical information that is contained in the diagram. Lemma 4.20 Let y Γ 2(x), z the unique point of Γ (x) collinear with y and Q the unique quad through the line yz S. Then the t lines of Q through y distinct from yz have type (2, 3 ). Proof. Recall that by Property (P2), there is indeed a unique point z Γ (x) collinear with y. By Lemma 4.0, the line L z contains s points of Γ 2(x). By Lemma 4.5, L z is contained in Q. If L is one of the t lines of Q through y distinct from yz, then every point of L \ {y} is collinear with a point of L z \ {z} Γ 2(x) and hence is contained in Γ 3(x) by the definition of Γ 3(x). Lemma 4.2 Every point y of Γ 3(x) is incident with a unique line of type (2, 3 ), t lines of type (2, 3 ) and t t lines of type (3, 4). Proof. By Lemma 4.4, there is a unique line of type (2, 3 ) through y and by Property (P3), there are precisely t lines of type (2, 3 ) through y. The remaining t t lines through y should all have type (3, 4). Lemma 4.22 Every point y of Γ 2(x) is incident with a unique line of type (, 2 ), t lines of type (2, 3 ) and t t lines of type (2, 3 ). 3

14 Proof. By Lemmas 4.2 and 4.20, the number of edges between Γ 2(x) and Γ 3(x) is at least Γ 2(x) st = s 3 tt (t t ), with equality if and only if every point of type 2 is incident with precisely t lines of type (2, 3 ). By Lemma 4.5 and Property (P3), we know that the number of edges between Γ 2(x) and Γ 3(x) is precisely Γ 3(x) t = s 3 tt (t t ). So, the point y Γ 2(x) is incident with precisely t lines of type (2, 3 ). By Property (P2), y is incident with a unique line of type (, 2 ). The remaining t t lines through y should have type (2, 3 ). Lemma 4.23 Every point of Γ 3(x) is contained in t t lines of type (2, 3 ) and t + t t lines of type (3, 4). Proof. This follows from Property (P4) 4 and the discussion so far regarding the types of lines in S, where we deduced that the only types of lines through a point of type 3 are (2, 3 ) and (3, 4). Lemma 4.24 We have Γ 3(x) = s 3 t (t t ) 2. Proof. By Lemmas 4.2 and 4.22, the number of edges between Γ 2(x) and Γ 3(x) is equal to Γ 2(x) (t t )s = s 3 t(t t ) 2. By Lemma 4.23, this number is also equal to Γ 3(x) t. t Hence, Γ 3(x) = s 3 t (t t ) 2. Lemma 4.25 Let L be a line of S meeting Γ 3(x) and Γ 4 (x). If Q is a quad through L, then Q contains at most one point at distance 2 from x. Proof. Since the quad Q contains a point at distance 4 from x, it contains a point at distance 2 from x if and only if x is classical with respect to Q. But then d(x, Q) = 2 and Q contains a unique point at distance 2 from x. Lemma 4.26 Let L be a line of S having type (3, 4). Then all t quads through L contain t a unique point of type 2 and a unique line of type (2, 3 ). This point of type 2 is the unique point of the quad at distance 2 from x, and this line of type (2, 3 ) belongs to S. Proof. Let y be the unique point of L contained in Γ 3(x). By Property (P4), there are t lines K through y meeting Γ t 2(x) giving rise by Lemma 4.25 to t distinct quads K, L t through L. These are all the quads through L by Lemma 4.8. Let Q be any of these t quads and let z denote the unique point in Q Γ 2 (x). By Lemmas 4.20 and 4.22, the t lines of type (2, 3 ) through z Γ 2(x) are all contained in a quad Q through z. As Q contains a point of Γ (x), we have Q Q and so Q Q is at most a line. As L z Q Q, we have L z = Q Q. Obviously, L z = Q Q is the unique line of type (2, 3 ) of Q. Lemma 4.27 Every point y of Γ 4 (x) is incident with t t lines of type (3, 4) and t + t t lines of type (3, 4). 4 Note that this is the first time we have used this property. 4

15 Γ 0 (x) t Γ (x) Γ 2(x) Γ 3(x) t s t t s t t t t s s s s s s t t Γ 4 (x) t + t t t Γ (x) t t s t Γ t t 2(x) s t t t + t t Γ 3(x) Figure 2: The structure of S with respect to a fixed point x Proof. If L is a line through y meeting Γ 3(x), then Lemmas 4.9 and 4.7 imply that there is a unique quad through L and this quad contains the line L y of type (3, 4). Conversely, by Lemma 4.26, any of the t quads through L t y contains a unique line through y meeting Γ 3(x). So, there are t lines through y meeting Γ t 3(x) and t + t lines meeting Γ t 3(x). Lemma 4.28 We have Γ 4 (x) = s 4 t (t t ) 2. Proof. By Lemmas 4.5 and 4.2, the number of edges between Γ 3(x) and Γ 4 (x) is equal to Γ 3(x) (t t )s = s 4 t(t t ) 2. By Lemma 4.27, the number of such edges is also equal to Γ 4 (x) t. It follows that Γ t 4 (x) = s 4 t (t t ) 2. Thus we have determined all the numerical information given in Figure 2. We now prove that the geometry defined on elements of the line spread S and the set of quads of S form a generalized hexagon. Lemma 4.29 Every point-quad pair (y, Q) is classical. Proof. Without loss of generality, we may suppose that y = x. We have already remarked above that (x, Q) is classical if d(x, Q). By Lemmas 4.4 and 4.26, (x, Q) is classical if Q contains points at distance 4 from x. So, suppose Q Γ 2 (x) Γ 3 (x). Let y Q Γ 2 (x). Then L y Q implies by Lemma 4.0 that y Γ 2(x). So, y Γ 2(x). The line L y meets Γ 3(x). By (P2), y is collinear with a unique point z of Γ (x). Denote by Q the unique quad through yz and L y. By Lemmas 4.20 and 4.22, the t lines of type (2, 3 ) through y are the t lines of Q through y distinct from yz. Each of the t t lines through y meeting Γ 3(x) determines a quad together with L y and such a quad has t lines through y meeting Γ 3(x). So, there are t t = t quads through L t t y meeting Γ 3(x) and hence also Γ 4 (x) as the unique line of S through a point of Γ 3(x) meets Γ 4 (x). Taking into account Q, we have thus accounted for all t quads through y, and none of these quads can be contained t in Γ 2 (x) Γ 3 (x). 5

16 Lemma 4.30 Two distinct lines L and L 2 of S lie at distance from each other if and only if they are contained in the same quad. If d(l, L 2 ) =, then L and L 2 are parallel. Proof. If L and L 2 are contained in a quad, then they are parallel and d(l, L 2 ) =. Conversely, suppose that d(l, L 2 ) = and let x L and x 2 L 2 such that d(x, x 2 ) =. The unique quad through the line x x 2 then contains L and L 2. Lemma 4.3 Every two lines K and L of S are parallel. Proof. Let k K and l L such that d(k, L) = d(k, l). We must show that every point of K has distance at most δ := d(k, l) from L. Let k = y 0, y,..., y δ = l be a path connecting k and l. Put L i := L yi, i {0,,..., δ}. Then for every i {, 2,..., δ}, the lines L i and L i are either equal or parallel and at distance. So, every point of L i has distance at most from a point of L i. This implies that every point of K = L 0 has distance at most δ from L = L δ. Let Q denote the set of quads of S. For the rest of this section let S be the point-line geometry with point set S and line set Q, where incidence is containment. Lemma 4.32 If L, L 2 S, then the distance d between L and L 2 in S is equal to d(l, L 2 ). Proof. Put d := d and d 2 := d(l, L 2 ). Suppose L = K 0, K,..., K d = L 2 is a (shortest) path in S connecting L and L 2. Then the K i s are mutually disjoint. Let x 0 be an arbitrary point of K 0 and for every i {, 2,..., d }, let x i denote the unique point of K i collinear with x i. Then x 0 L lies at distance at most d from x d L 2, showing that d 2 d. Suppose y 0, y,..., y d2 is a (shortest) path of length d 2 in S connecting a point y 0 L with a point y d2 L 2. In the sequence L y0, L y,..., L yd2, any two consecutive lines are either equal or at distance from each other (in S ) by Lemma So, we should also have that d d 2. We conclude that d = d 2. Lemma 4.33 S has order (st, t t ). Proof. By Lemma 4.5, every line of S contains precisely + st points (namely the size of a line spread of a generalized quadrangle of order (s, t )). By Lemmas 4.4 and 4.8, every line of S is contained in precisely t quads, showing that every point of S is incident with t precisely t lines of S. t Lemma 4.34 S is a near hexagon. Proof. Let L S and Q Q. Denote by S Q the set of lines of S contained in Q. By Lemma 4.5, S Q is a line spread of the generalized quadrangle Q. Let x be an arbitrary point of L. As x is classical with respect to the quad Q, there exists a unique point x Q nearest to x. By Lemma 4.32, L x is the unique line of S Q at distance d(x, x ) from L x = L in the geometry S. Every other line of S Q has distance d(x, x ) + from L x = L. 6

17 It remains to show that S has diameter 3. By Lemma 4.32, the diameter of S is at most 3. If x and x 2 are two points of S at distance 4 from each other, then the fact that L x and L x2 are parallel implies that they lie at distance 3 from each other (both in S as S ). So, the diameter of S is indeed 3. Lemma 4.35 Every two points of S at distance 2 from each other have a unique common neighbour. Proof. Let L, L 2 S be at distance 2 from each other in the geometry S and suppose M, M 2 S are two distinct neighbours of L, L 2. The lines L, L 2, M, M 2 are mutually parallel. By Lemma 4.32, there exist points x L and x 2 L 2 at distance 2 from each other. By Lemmas 4.3 and 4.32, the points x, x 2 have at least two common neighbours, one on M and another one on M 2. So, x and x 2 are contained in a quad Q. This quad should contain the line L x = L, but that is impossible since d(x 2, L ) = 2. The following is an immediate consequence of Lemmas 4.33, 4.34 and Corollary 4.36 S is a generalized hexagon of order (st, t t ). Theorem.2(b) is an immediate consequence of Figure and Corollary 4.36 (with s = 2, t = 2 and t = 4). Similarly, Proposition.(b) (with exception of the isomorphism S = H(4) D ) is a consequence of Corollary 4.36 and Figure of [] (with s = 2, t = 2 and t = 0). By Theorem 3.4, there exists a full embedding of O 2 to O mapping S 2 of S. Via this full embedding, the geometry S 2 = H(4, ) becomes a subgeometry of S = H(4) D, showing that the near octagons of order (2, 4) constructed in [, Theorem.2] are isomorphic to O 2. The finite near octagons S = (P, L, I) of order (s, t) with s 2 having a line spread S for which Properties (P), (P2), (P3) and (P4) are satisfied with t = can be completely described. Suppose S is the direct or cartesian product H L s+ of a generalized hexagon H of order (s, t ) and a line L s+ of size s + 3 (as defined in Brouwer and Wilbrink [5, Section (a)]). Then there exist two partitions S and U of P such that the following hold: S is a line spread. Every U U is a convex subspace and Ũ = H. Every line of S intersects every element of U in a singleton. Then (S, S) satisfies the Properties (P) (P4) with t =. Moreover, if x P and U x denotes the unique element of U containing x, then Γ i (x) with i {, 2, 3} is the set of points of U x at distance i from x; 7

18 Γ i(x) with i {, 2, 3} is the set of points of P \ U x at distance i from x. We refer to the above example as a trivial member of the family of near octagons. We can now prove the following. Proposition 4.37 Suppose (S, S) satisfies the conditions (P) (P4) with t =. Then S is the cartesian product of a generalized hexagon of order (s, t ) and a line of size s +. Proof. Fix a line L S. For every x L, let H x denote the set of all points y of S for which x is the unique point on L nearest to y. As lines of S are mutually parallel (see Lemma 4.3), we know that the following holds. (a) Every line of S contains a unique point of each H x, x L. Now, let Q be a quad of S. As Q has order (s, t ) = (s, ), Q is an (s + ) (s + )-grid. The set S Q of lines of S contained in Q is a line spread of Q. Let S Q denote the set of all remaining lines of Q. Then S Q is the second line spread of Q. If L is the unique line of S Q nearest to L in S, then every point x L is classical with respect to Q with π Q (x) L, implying the following: (b) A quad Q of S intersects each H x, x L, in a line of S Q. We also know that every line of S not belonging to S is contained in a unique quad. By (a) and (b), we now see that each H x, x L, is a subspace for which H x = S is a generalized hexagon of order (s, t ) = (s, t ) and that S t = H x L s+. 5 Determination of Aut(O 2 ) This section is devoted to the determination of the full automorphism group Aut(O 2 ) of the near octagon O 2. As before, we denote by Q 2 the set of all quads (isomorphic to W (2)) of O 2. The set of all lines of O 2 that are contained in two quads is then a line spread S 2 of O 2. Recall that the point-line geometry S 2 defined by S 2 and Q 2 is a generalized hexagon of order (4, ). For every point x of O 2, we denote by L x the unique line of S 2 containing x. The following lemma is well known and straightforward to prove. Lemma 5. () If σ is a nontrivial elation with center x and axis L and θ is a collineation of PG(2, 4), then θ σθ is a nontrivial elation with center x θ and axis L θ. (2) If σ is a nontrivial elation with center x and axis L and θ is a correlation of PG(2, 4), then θ σθ is a nontrivial elation with center L θ and axis x θ. 8

19 Lemma 5.2 Every automorphism θ of O 2 permutes the elements of the line spread S 2 and hence determines an automorphism of the generalized hexagon S 2 = H(4, ) defined by S 2 and Q 2. Proof. The automorphism θ permutes the quads of O 2 and hence the lines of O 2 that can be obtained as intersection of two quads (these are the elements of S 2 ). Lemma 5.3 Let Q be a quad of O 2 and let L, L 2, L 3, L 4, L 5 the five lines of S 2 contained in Q. If θ is an automorphism of O 2 fixing each of these lines, then θ fixes each point of Q. Proof. Let x be an arbitrary point of Q, L = {x, y, z} a line through x not belonging to S 2 and contained in Q. Since Q is isomorphic to W (2), the line L is the unique line of Q meeting L x, L y and L z. As L θ x = L x, L θ y = L y and L θ z = L z, it follows that L θ = L and x θ = x. The following is a consequence of Lemma 5.3. Corollary 5.4 If θ is an automorphism of O 2 fixing each line of S 2, then θ is trivial. Lemma 5.5 Let Q be a quad of O 2, and L, L 2, L 3, L 4, L 5 the five lines of S 2 contained in Q. If θ is an automorphism of O 2 such that L θ = L, L θ 2 = L 2, L θ 3 = L 4, L θ 4 = L 5 and L θ 5 = L 3, then θ permutes the points of L according to a cycle of length 3. Proof. For every i {3, 4, 5}, choose the collinear points a i L and b i L 2 such that a i b i is the unique line of Q meeting L, L 2 and L i. As L θ = L, L θ 2 = L 2, L θ 3 = L 4, L θ 4 = L 5 and L θ 5 = L 3, we have a θ 3 = a 4, a θ 4 = a 5 and a θ 5 = a 3. Recall from Lemma 5.2 that every automorphism O 2 induces an automorphism of S 2 = H(4, ). By Corollary 5.4, we then know the following. Corollary 5.6 Every automorphism of S 2 is induced by at most one automorphism of O 2. Now, let G denote the subgroup of Aut(S 2 ) = L 3 (4):D 2 consisting of all automorphisms θ of S 2 that are induced by automorphisms of O 2. Recall that the points of S 2 = H(4, ) can be identified with the flags of PG(2, 4) and the lines of S 2 with the points and lines of PG(2, 4). Consider now a subgroup H of Aut(S 2 ) with order 3 corresponding to a group of homologies of PG(2, 4) with axis M and center p M. Lemma 5.7 We have H G = {}. Proof. Suppose θ H G \ {} is induced by an automorphism θ of O 2. Let Q be the quad of O 2 corresponding to M, and let Q 2 be a quad of O 2 corresponding to a point q of M. Then Q Q 2 is the line of S 2 corresponding to the flag (q, M) of PG(2, 4). 9

20 Now, every homology with center p and axis M fixes each point of M, implying that all lines of S 2 contained in Q are fixed by θ. By Lemma 5.3, this implies that θ fixes each point of Q Q 2. Every nontrivial homology with center p and axis M fixes the lines pq, M and permutes the other three lines through q according to a cycle of length 3. This implies that θ fixes two lines of S 2 contained in Q 2 (including Q Q 2 ) and permutes the other three according to a cycle of length 3. By Lemma 5.5, this implies that θ permutes the points of Q Q 2 according to a cycle of length 3. This is however impossible as we have already shown that θ fixes all points of Q Q 2. Proposition 5.8 We have Aut(O 2 ) = L 3 (4):2 2. The automorphisms of O 2 are given by conjugations by elements of L 3 (4):2 2. Proof. From Lemma 5. it follows that the action of the group L 3 (4):D 2 and hence of the group L 3 (4):2 2 on the elations via conjugation is faithful. Hence, L 3 (4):2 2 can be regarded as a group of automorphisms of O 2, where the action is given by conjugation. To complete the proof of the proposition, it suffices to show that Aut(O 2 ) L 3 (4):2 2. But that is not so hard if one invokes Lemma 5.7. As G H = {}, we have 3 G = G H = GH L 3 (4):D 2, implying that Aut(O 2 ) = G L 3 (4): Connection with a distance-regular graph discovered by Soicher Let Γ denote the Gewirtz graph, that is the unique strongly regular graph with parameters (v, k, λ, µ) = (56, 0, 0, 2). The automorphism group Aut(Γ) of Γ is isomorphic to L 3 (4):2 2. We have computationally verified (see [3]) that if σ is a central involution of Aut(Γ) = L 3 (4):2 2, then the set X σ of vertices fixed by σ is a set of size 8 and that the subgraph of Γ induced on X σ is the union of two cycles of length 4. Moreover, the central involution σ is uniquely determined by the set X σ : the element-wise stabilizer of X σ inside Aut(Γ) is a group of order 2 generated by σ. Any set of vertices of Γ of the form X σ for some central involution σ of Aut(Γ) will be called a special 8-set of Γ. In [], L. Soicher constructed a distance-regular graph Υ (which is also distancetransitive) of diameter 4 with intersection array {b 0, b, b 2, b 3 ; c, c 2, c 3, c 4 } = {56, 45, 6, ;, 8, 45, 56} in the following way. Let C be the smallest conjugacy class of elements of order 3 in the group Suz:2. Let c denote an arbitrary element of C and denote by V the set of all c C for which cc has order 2. Then Υ is the graph with vertex set V, where two vertices x and y are adjacent whenever xy has order 2. If x is a vertex of Υ, then by [] we know that Υ 2 (x) = 35 and that the local graph Υ x is isomorphic to the Gewirtz graph. The stabilizer G x of x inside G = Aut(Υ) is isomorphic to L 3 (4):2 2 whose natural action on Υ (x) is equivalent with the natural action of Aut(Γ) on Γ. We have computationally verified (see [3]) that if y Υ 2 (x), then the set Υ (x) Υ (y) is a special 8-set X y of the Gewirtz graph Υ x, i.e. there exists a unique central involution 20

Dense near octagons with four points on each line, III

Dense near octagons with four points on each line, III Dense near octagons with four points on each line, III Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be

More information

Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad

Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be Abstract

More information

A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q)

A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) Joris De Kaey and Hendrik Van Maldeghem Ghent University, Department of Pure Mathematics and Computer

More information

Generalized Quadrangles with a Spread of Symmetry

Generalized Quadrangles with a Spread of Symmetry Europ. J. Combinatorics (999) 20, 759 77 Article No. eujc.999.0342 Available online at http://www.idealibrary.com on Generalized Quadrangles with a Spread of Symmetry BART DE BRUYN We present a common

More information

Codes from generalized hexagons

Codes from generalized hexagons Codes from generalized hexagons A. De Wispelaere H. Van Maldeghem 1st March 2004 Abstract In this paper, we construct some codes that arise from generalized hexagons with small parameters. As our main

More information

Every generalized quadrangle of order 5 having a regular point is symplectic

Every generalized quadrangle of order 5 having a regular point is symplectic Every generalized quadrangle of order 5 having a regular point is symplectic Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be

More information

European Journal of Combinatorics. Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces

European Journal of Combinatorics. Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces European Journal of Combinatorics 31 (2010) 1586 1593 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Locally subquadrangular hyperplanes

More information

Lax embeddings of the Hermitian Unital

Lax embeddings of the Hermitian Unital Lax embeddings of the Hermitian Unital V. Pepe and H. Van Maldeghem Abstract In this paper, we prove that every lax generalized Veronesean embedding of the Hermitian unital U of PG(2, L), L a quadratic

More information

Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces

Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces J. A. Thas H. Van Maldeghem 1 Introduction Definition 1.1 A (finite) generalized quadrangle (GQ) S = (P, B, I) is a point-line incidence

More information

Vertex opposition in spherical buildings

Vertex opposition in spherical buildings Vertex opposition in spherical buildings Anna Kasikova and Hendrik Van Maldeghem Abstract We study to which extent all pairs of opposite vertices of self-opposite type determine a given building. We provide

More information

Embeddings of Small Generalized Polygons

Embeddings of Small Generalized Polygons Embeddings of Small Generalized Polygons J. A. Thas 1 H. Van Maldeghem 2 1 Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, jat@cage.rug.ac.be 2 Department

More information

EXERCISE SHEET 2 WITH SOLUTIONS

EXERCISE SHEET 2 WITH SOLUTIONS EXERCISE SHEET 2 WITH SOLUTIONS Some solutions are sketches only. If you want more details, ask me! (E35) Show that, for any prime power q, PG 2 (q) is an abstract projective plane. Answer. If < u > and

More information

Ree Geometries. Abstract

Ree Geometries. Abstract arxiv:0909.3211v1 [math.gr] 17 Sep 2009 Ree Geometries Fabienne Haot Koen Struyve Hendrik Van Maldeghem Abstract We introduce a rank 3 geometry for any Ree group over a not necessarily perfect field and

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multiple extensions of generalized hexagons related to the simple groups McL and Co3. Author(s) Cuypers,

More information

Strongly regular graphs constructed from groups

Strongly regular graphs constructed from groups Strongly regular graphs constructed from groups Dean Crnković Department of Mathematics University of Rijeka Croatia Symmetry vs Regularity Pilsen, Czech Republic, July 2018 This work has been fully supported

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Finite affine planes in projective spaces

Finite affine planes in projective spaces Finite affine planes in projective spaces J. A.Thas H. Van Maldeghem Ghent University, Belgium {jat,hvm}@cage.ugent.be Abstract We classify all representations of an arbitrary affine plane A of order q

More information

Simple connectedness of the 3-local geometry of the Monster. A.A. Ivanov. U. Meierfrankenfeld

Simple connectedness of the 3-local geometry of the Monster. A.A. Ivanov. U. Meierfrankenfeld Simple connectedness of the 3-local geometry of the Monster A.A. Ivanov U. Meierfrankenfeld Abstract We consider the 3-local geometry M of the Monster group M introduced in [BF] as a locally dual polar

More information

Generalised quadrangles with a group of automorphisms acting primitively on points and lines

Generalised quadrangles with a group of automorphisms acting primitively on points and lines Generalised quadrangles with a group of automorphisms acting primitively on points and lines John Bamberg a, Michael Giudici a, Joy Morris b, Gordon F. Royle a, Pablo Spiga a a The Centre for the Mathematics

More information

Partial cubes: structures, characterizations, and constructions

Partial cubes: structures, characterizations, and constructions Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes

More information

Primitive arcs in P G(2, q)

Primitive arcs in P G(2, q) Primitive arcs in P G(2, q) L. Storme H. Van Maldeghem December 14, 2010 Abstract We show that a complete arc K in the projective plane P G(2, q) admitting a transitive primitive group of projective transformations

More information

Permutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation

Permutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation Notation Basics of permutation group theory Arc-transitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics

More information

Regular Actions on Generalized Polygons

Regular Actions on Generalized Polygons Regular Actions on Generalized Polygons H. Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, hvm@cage.rug.ac.be Abstract In [2], Theo Grundhöfer

More information

Exterior powers and Clifford algebras

Exterior powers and Clifford algebras 10 Exterior powers and Clifford algebras In this chapter, various algebraic constructions (exterior products and Clifford algebras) are used to embed some geometries related to projective and polar spaces

More information

Collineations of polar spaces with restricted displacements

Collineations of polar spaces with restricted displacements Collineations of polar spaces with restricted displacements B. Temmermans J. A. Thas H. Van Maldeghem Department of Mathematics, Ghent University, Krijgslaan 281, S22, B 9000 Gent btemmerm@cage.ugent.be,

More information

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM

More information

A Geometric Characterization of the Perfect Ree-Tits Generalized Octagons.

A Geometric Characterization of the Perfect Ree-Tits Generalized Octagons. A Geometric Characterization of the Perfect Ree-Tits Generalized Octagons. H. Van Maldeghem Dedicated to Prof. J. Tits on the occasion of his 65th birthday 1 Introduction The world of Tits-buildings, created

More information

Isomorphisms between pattern classes

Isomorphisms between pattern classes Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.

More information

Stab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.

Stab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1. 1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group

More information

Moufang lines defined by (generalized) Suzuki groups

Moufang lines defined by (generalized) Suzuki groups Moufang lines defined by (generalized) Suzuki groups Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281 S22, 9000 Gent, Belgium email: hvm@cage.ugent.be

More information

Exercises on chapter 1

Exercises on chapter 1 Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G

More information

Strongly regular graphs and the Higman-Sims group. Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012

Strongly regular graphs and the Higman-Sims group. Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012 Strongly regular graphs and the Higman-Sims group Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012 We introduce some well known results about permutation groups, strongly regular

More information

Domesticity in projective spaces

Domesticity in projective spaces Innovations in Incidence Geometry Volume 12 (2011), Pages 141 149 ISSN 1781-6475 ACADEMIA PRESS Domesticity in projective spaces Beukje Temmermans Joseph A. Thas Hendrik Van Maldeghem Abstract Let J be

More information

Intriguing sets of vertices of regular graphs

Intriguing sets of vertices of regular graphs Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the

More information

Generalized polygons in projective spaces

Generalized polygons in projective spaces Generalized polygons in projective spaces Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B-9000 Gent, Belgium, e-mail: hvm@cage.rug.ac.be 1 Introduction

More information

On the nilpotent conjugacy class graph of groups

On the nilpotent conjugacy class graph of groups Note di Matematica ISSN 1123-2536, e-issn 1590-0932 Note Mat. 37 (2017) no. 2, 77 89. doi:10.1285/i15900932v37n2p77 On the nilpotent conjugacy class graph of groups A. Mohammadian Department of Pure Mathematics,

More information

Bichain graphs: geometric model and universal graphs

Bichain graphs: geometric model and universal graphs Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United

More information

Geometric Characterizations of Finite Chevalley Groups of Type B 2

Geometric Characterizations of Finite Chevalley Groups of Type B 2 Geometric Characterizations of Finite Chevalley Groups of Type B 2 Koen Thas Hendrik Van Maldeghem Ghent University Department of Pure Mathematics and Computer Algebra Galglaan 2, B-9000 Ghent, Belgium

More information

Rank 3 Latin square designs

Rank 3 Latin square designs Rank 3 Latin square designs Alice Devillers Université Libre de Bruxelles Département de Mathématiques - C.P.216 Boulevard du Triomphe B-1050 Brussels, Belgium adevil@ulb.ac.be and J.I. Hall Department

More information

The geometry of secants in embedded polar spaces

The geometry of secants in embedded polar spaces The geometry of secants in embedded polar spaces Hans Cuypers Department of Mathematics Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands June 1, 2006 Abstract Consider

More information

Groups and Symmetries

Groups and Symmetries Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group

More information

DIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS

DIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS DIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS LUKE MORGAN, JOY MORRIS, AND GABRIEL VERRET Abstract. Let Γ = Cay(G, S) be a Cayley digraph on a group G and let A =

More information

Generalized Quadrangles Weakly Embedded in Finite Projective Space

Generalized Quadrangles Weakly Embedded in Finite Projective Space Generalized Quadrangles Weakly Embedded in Finite Projective Space J. A. Thas H. Van Maldeghem Abstract We show that every weak embedding of any finite thick generalized quadrangle of order (s, t) in a

More information

Automorphism groups of wreath product digraphs

Automorphism groups of wreath product digraphs Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy

More information

arxiv: v1 [math.co] 1 Jan 2019

arxiv: v1 [math.co] 1 Jan 2019 ARC-TRANSITIVE GRAPHS OF VALENCY TWICE A PRIME ADMIT A SEMIREGULAR AUTOMORPHISM MICHAEL GIUDICI AND GABRIEL VERRET arxiv:1901.00084v1 [math.co] 1 Jan 2019 Abstract. We prove that every finite arc-transitive

More information

Characterizations of Segre Varieties

Characterizations of Segre Varieties Characterizations of Segre Varieties J. A Thas H. Van Maldeghem Abstract In this paper several characterizations of Segre varieties and their projections are given. The first two characterization theorems

More information

Characterizations of the finite quadric Veroneseans V 2n

Characterizations of the finite quadric Veroneseans V 2n Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our

More information

Twisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems

Twisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 49 (2008), No. 2, 341-368. Twisted Projective Spaces and Linear Completions of some Partial Steiner Triple Systems Ma lgorzata

More information

Imprimitive symmetric graphs with cyclic blocks

Imprimitive symmetric graphs with cyclic blocks Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information

The Witt designs, Golay codes and Mathieu groups

The Witt designs, Golay codes and Mathieu groups The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector

More information

Chordal Coxeter Groups

Chordal Coxeter Groups arxiv:math/0607301v1 [math.gr] 12 Jul 2006 Chordal Coxeter Groups John Ratcliffe and Steven Tschantz Mathematics Department, Vanderbilt University, Nashville TN 37240, USA Abstract: A solution of the isomorphism

More information

Shult Sets and Translation Ovoids of the Hermitian Surface

Shult Sets and Translation Ovoids of the Hermitian Surface Shult Sets and Translation Ovoids of the Hermitian Surface A. Cossidente, G. L. Ebert, G. Marino, and A. Siciliano Abstract Starting with carefully chosen sets of points in the Desarguesian affine plane

More information

Irreducible subgroups of algebraic groups

Irreducible subgroups of algebraic groups Irreducible subgroups of algebraic groups Martin W. Liebeck Department of Mathematics Imperial College London SW7 2BZ England Donna M. Testerman Department of Mathematics University of Lausanne Switzerland

More information

Some contributions to incidence geometry and the polynomial method

Some contributions to incidence geometry and the polynomial method Some contributions to incidence geometry and the polynomial method Anurag Bishnoi Some contributions to incidence geometry and the polynomial method Anurag Bishnoi Promotor: Prof. Dr. Bart De Bruyn A

More information

Groups of Prime Power Order with Derived Subgroup of Prime Order

Groups of Prime Power Order with Derived Subgroup of Prime Order Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*

More information

Arc-transitive pentavalent graphs of order 4pq

Arc-transitive pentavalent graphs of order 4pq Arc-transitive pentavalent graphs of order 4pq Jiangmin Pan Bengong Lou Cuifeng Liu School of Mathematics and Statistics Yunnan University Kunming, Yunnan, 650031, P.R. China Submitted: May 22, 2012; Accepted:

More information

Some notes on Coxeter groups

Some notes on Coxeter groups Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three

More information

Cocliques in the Kneser graph on line-plane flags in PG(4, q)

Cocliques in the Kneser graph on line-plane flags in PG(4, q) Cocliques in the Kneser graph on line-plane flags in PG(4, q) A. Blokhuis & A. E. Brouwer Abstract We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4,

More information

A Questionable Distance-Regular Graph

A Questionable Distance-Regular Graph A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection

More information

A NOTE ON POINT STABILIZERS IN SHARP PERMUTATION GROUPS OF TYPE {0, k}

A NOTE ON POINT STABILIZERS IN SHARP PERMUTATION GROUPS OF TYPE {0, k} A NOTE ON POINT STABILIZERS IN SHARP PERMUTATION GROUPS OF TYPE {0, k} DOUGLAS P. BROZOVIC AND PETER K. SIN Abstract. We study sharp permutation groups of type {0, k} and observe that, once the isomorphism

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Examples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are

Examples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are Cosets Let H be a subset of the group G. (Usually, H is chosen to be a subgroup of G.) If a G, then we denote by ah the subset {ah h H}, the left coset of H containing a. Similarly, Ha = {ha h H} is the

More information

Automorphism Groups of Simple Moufang Loops over Perfect Fields

Automorphism Groups of Simple Moufang Loops over Perfect Fields Automorphism Groups of Simple Moufang Loops over Perfect Fields By GÁBOR P. NAGY SZTE Bolyai Institute Aradi vértanúk tere 1, H-6720 Szeged, Hungary e-mail: nagyg@math.u-szeged.hu PETR VOJTĚCHOVSKÝ Department

More information

A characterization of graphs by codes from their incidence matrices

A characterization of graphs by codes from their incidence matrices A characterization of graphs by codes from their incidence matrices Peter Dankelmann Department of Mathematics University of Johannesburg P.O. Box 54 Auckland Park 006, South Africa Jennifer D. Key pdankelmann@uj.ac.za

More information

THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS

THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 67 (2006) 2006, Pages 225 259 S 0077-1554(06)00156-7 Article electronically published on December 27, 2006 THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL

More information

Distance-j Ovoids and Related Structures in Generalized Polygons

Distance-j Ovoids and Related Structures in Generalized Polygons Distance-j Ovoids and Related Structures in Generalized Polygons Alan Offer and Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, Belgium

More information

The generating rank of the symplectic grassmannians: hyperbolic and isotropic geometry

The generating rank of the symplectic grassmannians: hyperbolic and isotropic geometry The generating rank of the symplectic grassmannians: hyperbolic and isotropic geometry Rieuwert J Blok Department of Mathematics and Statistics Bowling Green State University Bowling Green, OH 43403 USA

More information

The geometry of k-transvection groups

The geometry of k-transvection groups The geometry of k-transvection groups Hans Cuypers Department of Mathematics Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands December 8, 2005 To Professor Bernd Fischer

More information

Latin squares: Equivalents and equivalence

Latin squares: Equivalents and equivalence Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to

More information

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1

More information

Codes, Designs and Graphs from the Janko Groups J 1 and J 2

Codes, Designs and Graphs from the Janko Groups J 1 and J 2 Codes, Designs and Graphs from the Janko Groups J 1 and J 2 J. D. Key Department of Mathematical Sciences Clemson University Clemson SC 29634, U.S.A. J. Moori School of Mathematics, Statistics and Information

More information

Finite Generalized Quadrangles

Finite Generalized Quadrangles Finite Generalized Quadrangles S.E. Payne J.A. Thas ii Contents 1 Combinatorics of finite generalized quadrangles 1 1.1 Axioms and definitions.................................... 1 1.2 Restrictions on

More information

1 Fields and vector spaces

1 Fields and vector spaces 1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary

More information

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno 3.1. The denition. 3. G Groups, as men, will be known by their actions. - Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h

More information

Classification of discretely decomposable A q (λ) with respect to reductive symmetric pairs UNIVERSITY OF TOKYO

Classification of discretely decomposable A q (λ) with respect to reductive symmetric pairs UNIVERSITY OF TOKYO UTMS 2011 8 April 22, 2011 Classification of discretely decomposable A q (λ) with respect to reductive symmetric pairs by Toshiyuki Kobayashi and Yoshiki Oshima T UNIVERSITY OF TOKYO GRADUATE SCHOOL OF

More information

arxiv: v1 [math.co] 19 Nov 2016

arxiv: v1 [math.co] 19 Nov 2016 Tetravalent 2-transitive Cayley graphs of finite simple groups and their automorphism groups Xin Gui Fang a, Jie Wang a and Sanming Zhou b arxiv:1611.06308v1 [math.co] 19 Nov 2016 a LAMA and School of

More information

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions

More information

Even Cycles in Hypergraphs.

Even Cycles in Hypergraphs. Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and

More information

Locally primitive normal Cayley graphs of metacyclic groups

Locally primitive normal Cayley graphs of metacyclic groups Locally primitive normal Cayley graphs of metacyclic groups Jiangmin Pan Department of Mathematics, School of Mathematics and Statistics, Yunnan University, Kunming 650031, P. R. China jmpan@ynu.edu.cn

More information

SOME STRONGLY REGULAR GRAPHS AND SELF-ORTHOGONAL CODES FROM THE UNITARY GROUP U 4 (3)

SOME STRONGLY REGULAR GRAPHS AND SELF-ORTHOGONAL CODES FROM THE UNITARY GROUP U 4 (3) GLASNIK MATEMATIČKI Vol. 45(65)(2010), 307 323 SOME STRONGLY REGULAR GRAPHS AND SELF-ORTHOGONAL CODES FROM THE UNITARY GROUP U 4 (3) Dean Crnković, Vedrana Mikulić and B. G. Rodrigues University of Rijeka,

More information

Asymptotically optimal induced universal graphs

Asymptotically optimal induced universal graphs Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (

More information

TRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS

TRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS Journal of Algebra and Related Topics Vol. 2, No 2, (2014), pp 1-9 TRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS A. GHARIBKHAJEH AND H. DOOSTIE Abstract. The triple factorization

More information

Self-Complementary Arc-Transitive Graphs and Their Imposters

Self-Complementary Arc-Transitive Graphs and Their Imposters Self-Complementary Arc-Transitive Graphs and Their Imposters by Natalie Mullin A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics

More information

On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs

On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime

More information

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: Group Actions 8-26-202 Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: (a) θ(g,θ(g 2,x)) = θ(g g 2,x) for all g,g 2 G and x X. (b) θ(,x) =

More information

Algebraic aspects of Hadamard matrices

Algebraic aspects of Hadamard matrices Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices

More information

Locally maximal product-free sets of size 3

Locally maximal product-free sets of size 3 Locally maximal product-free sets of size 3 By Chimere S. Anabanti and Sarah B. Hart Birkbeck Pure Mathematics Preprint Series Preprint Number 10 www.bbk.ac.uk/ems/research/pure/preprints Locally maximal

More information

Split BN-pairs of rank at least 2 and the uniqueness of splittings

Split BN-pairs of rank at least 2 and the uniqueness of splittings Split BN-pairs of rank at least 2 and the uniqueness of splittings T. De Medts F. Haot K. Tent H. Van Maldeghem January 14, 2004 Abstract Let (G, B, N) be a group with an irreducible spherical BN-pair

More information

Algebra-I, Fall Solutions to Midterm #1

Algebra-I, Fall Solutions to Midterm #1 Algebra-I, Fall 2018. Solutions to Midterm #1 1. Let G be a group, H, K subgroups of G and a, b G. (a) (6 pts) Suppose that ah = bk. Prove that H = K. Solution: (a) Multiplying both sides by b 1 on the

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

Lenz-Barlotti I.4 Perspectivity Groups are Abelian

Lenz-Barlotti I.4 Perspectivity Groups are Abelian Lenz-Barlotti I.4 Perspectivity Groups are Abelian Robert A. Liebler and Elizabeth Scott-Janda Abstract: We extend a 1972 result of Kantor and Pankin and give a new elementary proof of the assertion in

More information

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.

More information

Automorphisms of strongly regular graphs and PDS in Abelian groups

Automorphisms of strongly regular graphs and PDS in Abelian groups Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke

More information

Generalized Veronesean embeddings of projective spaces, Part II. The lax case.

Generalized Veronesean embeddings of projective spaces, Part II. The lax case. Generalized Veronesean embeddings of projective spaces, Part II. The lax case. Z. Akça A. Bayar S. Ekmekçi R. Kaya J. A. Thas H. Van Maldeghem Abstract We classify all embeddings θ : PG(n, K) PG(d, F),

More information

arxiv: v4 [math.gr] 17 Jun 2015

arxiv: v4 [math.gr] 17 Jun 2015 On finite groups all of whose cubic Cayley graphs are integral arxiv:1409.4939v4 [math.gr] 17 Jun 2015 Xuanlong Ma and Kaishun Wang Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, 100875,

More information

Strongly Regular Decompositions of the Complete Graph

Strongly Regular Decompositions of the Complete Graph Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl

More information

6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1.

6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1. 6 Orthogonal groups We now turn to the orthogonal groups. These are more difficult, for two related reasons. First, it is not always true that the group of isometries with determinant 1 is equal to its

More information

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK

More information

Theorems of Erdős-Ko-Rado type in polar spaces

Theorems of Erdős-Ko-Rado type in polar spaces Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado

More information