Ovoids of generalized quadrangles of order (q,q2−q) and Delsarte cocliques in related strongly regular graphs
نویسندگان
چکیده
منابع مشابه
Flocks, ovoids and generalized quadrangles
Let (∞, π∞) be an incident point-plane pair of PG(3, q). A tetrad with respect to (∞, π∞) is a set {X,Y, Z,W} of points of PG(3, q) \ π∞ such that {∞, X, Y, Z,W} is a cap of PG(3, q), ∞ ∈ 〈X,Y, Z〉 and W 6∈ 〈X,Y, Z〉. A set Θ of ovoids of PG(3, q) is tetradic with respect to (∞, π∞) if each ovoid contains ∞, has tangent plane π∞ and is such that each tetrad with respect to (∞, π∞) is contained in...
متن کاملSpreads and ovoids of finite generalized quadrangles
We survey recent results on spreads and ovoids of finite generalized quadrangles. Included in the survey are results on ovoids of PG(3, q); translation ovoids of Q(4, q); characterisations of generalized quadrangles using subquadrangles and ovoids of subquadrangles; and spreads of T2(Ω).
متن کاملTranslation ovoids of flock generalized quadrangles
We give a characterization of translation ovoids of flock generalized quadrangles. Then we prove that, if q = 2e , each elation generalized quadrangle defined by a flock has a large class of translation ovoids which arise from semifields of dimension two over their left nucleus. Finally, we give some examples when q is odd. © 2003 Elsevier Ltd. All rights reserved. MSC (2000): Primary 51E12; Se...
متن کاملPartial Ovoids and Spreads in Generalized Quadrangles, and Related Combinatorial Structures
In this paper we overview what is known about partial ovoids and spreads of finite (classical) generalized quadrangles. In the first, respectively the second, part of the paper we will be mostly concerned with small, respectively large, maximal partial ovoids and spreads. Also connections with other interesting objects in finite geometry will be explained. Among the new results are new bounds o...
متن کاملMonomial graphs and generalized quadrangles
Let Fq be a finite field, where q = p for some odd prime p and integer e ≥ 1. Let f, g ∈ Fq[x, y] be monomials. The monomial graph Gq(f, g) is a bipartite graph with vertex partition P ∪L, P = Fq = L, and (x1, x2, x3) ∈ P is adjacent to [y1, y2, y3] ∈ L if and only if x2 + y2 = f(x1, y1) and x3 + y3 = g(x1, y1). Dmytrenko, Lazebnik, and Williford proved in [6] that if p ≥ 5 and e = 23 for integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2017
ISSN: 1063-8539
DOI: 10.1002/jcd.21598