Relative symplectic subquadrangle hemisystems of the Hermitian surface

We introduce the notion of relative subquadrangle regular system of a generalized quadrangle. A relative subquadrangle regular system of order m on a generalized quadrangle S of order (s, t) is a set \({\mathcal R}\) of embedded subquadrangles with a prescribed intersection property with respect to a given subquadrangle T such that every point of S T lies on exactly m subquadrangles of \({\mathcal R}\) . If m is one half of the total number of such subquadrangles on a point we call \({\mathcal R}\) a relative subquadrangle hemisystem with respect to T. We construct two infinite families of symplectic relative subquadrangle hemisystems of the Hermitian surface \({{\mathcal H}(3,q^2)}\) , q even.     

Relative hemisystems on the Hermitian surface

Let S be a generalized quadrangle of order (q ²,q) containing a subquadrangle S′ of order (q,q). Then any line of S either meets S′ in q+1 points or is disjoint from S′. After Penttila and Williford (J. Comb. Theory, Ser. A 118:502–509, 2011), we call a subset H of the lines disjoint from S′ a relative hemisystem of S with respect to S′, provided that for each point x of S?S′, exactly half of the lines through x disjoint from S′ lie in H. A new infinite family of relative hemisystems on the generalized quadrangle $\mathcal{H}(3,q^{2})$ admitting the linear group PSL(2,q) as an automorphism group is constructed. The association schemes arising from our construction are not equivalent to those arising from the Penttila–Williford relative hemisystems.     

Compact Ovoids in Quadrangles I: Geometric Constructions

This paper is about ovoids in infinite generalized quadrangles. Using the axiom of choice, Cameron showed that infinite quadrangles contain many ovoids. Therefore, we consider mainly closed ovoids in compact quadrangles. After deriving some basic properties of compact ovoids, we consider ovoids which arise from full imbeddings. This leads to restrictions for the topological parameters (m,m). For example, if there is a regular pair of lines or a full closed subquadrangle, then mm. The existence of full subquadrangles implies the nonexistence of ideal subquadrangles, so finite-dimensional quadrangles are either point-minimal or line-minimal. Another result is that (up to duality) such a quadrangle is spanned by the set of points on an ordinary quadrangle. This is useful for studying orbits of automorphism groups. Finally we prove general nonexistence results for ovoids in quadrangles with low-dimensional line pencils. As one consequence we show that the symplectic quadrangle over an algebraically closed field of characteristic 0 has no Zariski-closed ovoids or spreads.     

On m-regular systems on ℋ(5,q 2)

The notion of m-regular system on the Hermitian variety ℋ(n,q ²) was introduced by B. Segre (Ann. Math. Pura Appl. 70:1–201, 1965). Here, three infinite families of hemisystems on ℋ(5,q ²), q odd, are constructed.     

Hemisystems of small flock generalized quadrangles

In this paper, we describe a complete computer classification of the hemisystems in the two known flock generalized quadrangles of order (5², 5) and give numerous further examples of hemisystems in all the known flock generalized quadrangles of order (s ², s) for s ≤ 11. By analysing the computational data, we identify two possible new infinite families of hemisystems in the classical generalized quadrangle H(3, s ²).     

Embeddings of Un(q2) and symmetric strongly regular graphs

In the geometric setting of the embedding of the unitary group U_n(q²) inside an orthogonal or a symplectic group over the subfield GF(q) of GF(q²), q odd, we show the existence of infinite families of transitive two‐character sets with respect to hyperplanes that in turn define new symmetric strongly regular graphs and two‐weight codes. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 248–253, 2010     

On the nonexistence of certain Hughes generalized quadrangles

In this paper, we prove that the Hermitian quadrangle is the unique generalized quadrangle Γ of order (q ², q ³) containing some subquadrangle of order (q ², q) isomorphic to such that every central elation of the subquadrangle is induced by a collineation of Γ. Dedicated to Dan Hughes on the occasion of his 80th birthday.     

A spectrum result on maximal partial ovoids of the generalized quadrangle , even

This article presents a spectrum result on maximal partial ovoids of the generalized quadrangle Q(4,q), q even. We prove that for every integer k in an interval of, roughly, size [q²/10,9q²/10], there exists a maximal partial ovoid of size k on Q(4,q), q even. Since the generalized quadrangle W(q), q even, defined by a symplectic polarity of PG(3,q) is isomorphic to the generalized quadrangle Q(4,q), q even, the same result is obtained for maximal partial ovoids of W(q), q even. As equivalent results, the same spectrum result is obtained for minimal blocking sets with respect to planes of PG(3,q), q even, and for maximal partial 1-systems of lines on the Klein quadric Q⁺(5,q), q even.     

Regular graphs constructed from the classical generalized quadrangle Q(4, q)

Let c_k be the smallest number of vertices in a regular graph with valency k and girth 8. It is known that c_{k + 1}?2(1 + k + k² + k³) with equality if and only if there exists a finite generalized quadrangle of order k. No such quadrangle is known when k is not a prime power. In this case, small regular graphs of valency k + 1 and girth 8 can be constructed from known generalized quadrangles of order q>k by removing a part of its structure. We investigate the case when q = k + 1 is a prime power, and try to determine the smallest graph under consideration that can be constructed from a generalized quadrangle of order q. This problem appears to be much more difficult than expected. We have general bounds and improve these for the classical generalized quadrangle Q(4, q), q even. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:70‐83, 2010     

Spreads and ovoids in finite generalized quadrangles

This paper is a survey on the existence and non-existence of ovoids and spreads in the known finite generalized quadrangles. It also contains the following new results. We prove that translation generalized quadrangles of order (s,s ²), satisfying certain properties, have a spread. This applies to three known infinite classes of translation generalized quadrangles. Further a new class of ovoids in the classical generalized quadranglesQ(4, 3 ^e ),e3, is constructed. Then, by the duality betweenQ(4, 3 ^e ) and the classical generalized quadrangleW (3 ^e ), we get line spreads of PG(3, 3 ^e ) and hence translation planes of order 3^2e . These planes appear to be new. Note also that only a few classes of ovoids ofQ(4,q) are known. Next we prove that each generalized quadrangle of order (q ²,q) arising from a flock of a quadratic cone has an ovoid. Finally, we give the following characterization of the classical generalized quadranglesQ(5,q): IfS is a generalized quadrangle of order (q,q ²),q even, having a subquadrangleS isomorphic toQ(4,q) and if inS each ovoid consisting of all points collinear with a given pointx ofS\S is an elliptic quadric, thenS is isomorphic toQ(5,q).     

On a conjecture of Brouwer involving the connectivity of strongly regular graphs

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components.We show that strongly regular graphs constructed from copolar spaces and from the more general spaces called Δ-spaces are counterexamples to Brouwer?s Conjecture. Using J.I. Hall?s characterization of finite reduced copolar spaces, we find that the triangular graphs T(m), the symplectic graphs Sp(2r,q) over the field Fq (for any q prime power), and the strongly regular graphs constructed from the hyperbolic quadrics O⁺(2r,2) and from the elliptic quadrics O⁻(2r,2) over the field F₂, respectively, are counterexamples to Brouwer?s Conjecture. For each of these graphs, we determine precisely the minimum number of vertices whose removal disconnects the graph into non-singleton components. While we are not aware of an analogue of Hall?s characterization theorem for Δ-spaces, we show that complements of the point graphs of certain finite generalized quadrangles are point graphs of Δ-spaces and thus, yield other counterexamples to Brouwer?s Conjecture.We prove that Brouwer?s Conjecture is true for many families of strongly regular graphs including the conference graphs, the generalized quadrangles GQ(q,q) graphs, the lattice graphs, the Latin square graphs, the strongly regular graphs with smallest eigenvalue −2 (except the triangular graphs) and the primitive strongly regular graphs with at most 30 vertices except for few cases.We leave as an open problem determining the best general lower bound for the minimum size of a disconnecting set of vertices of a strongly regular graph, whose removal disconnects the graph into non-singleton components.     

A hemisystem of a nonclassical generalised quadrangle

The concept of a hemisystem of a generalised quadrangle has its roots in the work of B. Segre, and this term is used here to denote a set of points such that every line ℓ meets in half of the points of ℓ. If one takes the point-line geometry on the points of the hemisystem, then one obtains a partial quadrangle and hence a strongly regular point graph. The only previously known hemisystems of generalised quadrangles of order (q, q ²) were those of the elliptic quadric , q odd. We show in this paper that there exists a hemisystem of the Fisher–Thas–Walker–Kantor generalised quadrangle of order (5, 5²), which leads to a new partial quadrangle. Moreover, we can construct from our hemisystem the 3· A ₇-hemisystem of , first constructed by Cossidente and Penttila.      

Notes on binary codes related to the O(5, q) generalized quadrangle for odd q

In this note we determine the dimensions of the binary codes spanned by the lines or by the point neighborhoods in the generalized quadrangle Sp(4, q) and its dual O(5, q), where q is odd. Several more general results are given. As a side result we find that if a square generalized quadrangle of odd order has an antiregular point, then all of its points are antiregular.On leave from the Indian Statistical Institute, Calcutta; research supported by a grant from NWO.     

Intriguing sets in partial quadrangles

The point‐line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non‐incident pair (P, ?), there is at most one line through P concurrent with ?. So in particular, the well‐studied objects known as generalized quadrangles are each partial quadrangles. An intriguing set of a generalized quadrangle is a set of points which induces an equitable partition of size two of the underlying strongly regular graph. We extend the theory of intriguing sets of generalized quadrangles by Bamberg, Law and Penttila to partial quadrangles, which gives insight into the structure of hemisystems and other intriguing sets of generalized quadrangles. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:217‐245, 2011     

The uniqueness of 1-systems of W 5(q) satisfying the BLT-property, with q odd

In the symplectic polar space W ₅(q) every 1-system which satisfies the BLT-property (and then q is odd) defines a generalized quadrangle (GQ) of order (q ²,q ³). In this paper, we show that this 1-system is unique, so that the only GQ arising in this way is isomorphic to the classical GQ H(4,q ²), q odd.     

3-regularity in generalized quadrangles of order (s,s 2)

If (x, y, z) is a 3-regular triad of a generalized quadrangle S=(P, B, I) of order (s, s ²), s even, then {x, y, z} {x, y, z} is contained in a subquadrangle of order s. As an application it is proved that a generalized quadrangle of order (4, 16) with at least one 3-regular triad is isomorphic to the classical generalized quadrangle Q(5, 4) of order (4, 16).     

Tight sets and <Emphasis Type="Italic">m</Emphasis>-ovoids of generalised quadrangles

The concept of a tight set of points of a generalised quadrangle was introduced by S. E. Payne in 1987, and that of an m-ovoid of a generalised quadrangle was introduced by J. A. Thas in 1989, and we unify these two concepts by defining intriguing sets of points. We prove that every intriguing set of points in a generalised quadrangle is an m-ovoid or a tight set, and we state an intersection result concerning these objects. In the classical generalised quadrangles, we construct new m-ovoids and tight sets. In particular, we construct m-ovoids of W(3,q), q odd, for all even m; we construct (q+1)/2-ovoids of W(3,q) for q odd; and we give a lower bound on m for m-ovoids of H(4,q ²).     

Generalized quadrangles of order (q,q 2),q even,containingW(q) as a subquadrangle

In this paper we give a characterization of the generalized quadrangleQ(5,q),q even, in terms of ovoids of its subquadrangles.     

On some sets of dictionaries whose ω ‐powers have a given

A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ ⁰k) (respectively, ??( Π ⁰_k), ??( Δ ¹₁)) of dictionaries V ? 2* whose ω ‐powers are Σ ⁰_k‐sets (respectively, Π ⁰_k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ ⁰₂) and ??( Δ ¹₁), showing that the set ??( Δ ¹₁) is “more complex” than the set ??( Σ ⁰₂). As an application we improve the lower bound on the complexity of ??( Δ ¹₁) given by Lecomte, showing that ??( Δ ¹₁) is in Σ ¹ ₂(2^2*)\ Π ⁰₂. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π ⁰_k+1) (respectively, ??( Σ ⁰_{k +1})) is “more complex” than the set of dictionaries ??( Π ⁰_k) (respectively, ??( Σ ⁰_k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

If H is a regular Hadamard matrix with row sum 2h, m is a positive integer, and q = (2h ? 1)², then (4h ²(q ^{m + 1} ? 1)/(q ?1),(2h ² ? h)q ^m ,(h ²-h)q ^m ) are feasible parameters of a symmetric designs. If q is a prime power, then a balanced generalized weighing matrix BGW((q ^{m +1} ? 1)/(q?1),q ^m ,q ^m ?q ^{m ?1}) can be applied to construct such a design if H satisfies certain structural conditions. We describe such conditions and show that if H satisfies these conditions and B is a regular Hadamard matrix of Bush type, then B×H satisfies these structural conditions. This allows us to construct parametrically new infinite families of symmetric designs.