On Bruen chains
type: Item
instance of: scholarly article
title: On Bruen chains
author: John Bamberg
author: Jesse Lansdown
author: Geertrui Van de Voorde
published in: Finite Fields and their Applications
publication date: 2024-10-08T00:00:00Z
review text: Let \(q\) be an odd prime power, \(q \ge 5\), and let \(\mathcal{E}\) be an elliptic quadric of \(\mathrm{PG}(3, q)\) with associated quadratic form \(\mathrm{Q}\). A \textit{Bruen chain} is a set of \(\frac{q + 3}{2}\) conics of \(\mathcal{E}\) such that any two of them intersect in two points, and any three of them have empty intersection. The points of \(\mathrm{PG}(3, q) \setminus \mathcal{E}\) can be partitioned into two equally sized sets, say \(\mathbb{E}\) and \(\mathrm{PG}(3, q) \setminus (\mathbb{E} \cup \mathcal{E})\), according as the evaluation of \(\mathrm{Q}\) on these points is a square or it is not. Let \(\mathrm{cone}(P)\) be the cone having as vertex a point \(P \in \mathbb{E}\) and base \(P^\perp \cap \mathcal{E}\), where \(\perp\) denotes the polarity defining \(\mathcal{E}\).\N\NIn the present paper, by refining known results, it is shown that a Bruen chain can be seen as a pointset \(\mathcal{B}\) of size \(\frac{q + 3}{2}\) contained in \(\mathbb{E}\) and such that \(\mathrm{cone}(A) \cap \mathrm{cone}(B) \cap \mathrm{cone}(C) \subset \mathcal{E}\) for any three distinct points \(A,B,C \in \mathcal{B}\). Fix a point \(X \in \mathbb{E}\) and consider the subset \(\mathbb{V}\) of \(\mathbb{E} \setminus \{X\}\) consisting of points lying on an external line with \(X\). Let \(\Gamma_X\) be the graph having as vertices the \(\frac{q^3-q}{4}\) points of \(\mathbb{V}\), where two vertices \(A, B\) are adjacent whenever they are not collinear with \(X\) and \(\mathrm{cone}(A) \cap \mathrm{cone}(B) \cap \mathrm{cone}(X) \subset \mathcal{E}\). It is shown that the clique number \(\omega(\Gamma_X)\) is at most \(\frac{q+1}{2}\) and that cliques of size \(\frac{q+1}{2}\) of \(\Gamma_X\) are in one-to-one correspondence with Bruen chains. The sizes of a maximum clique of \(\Gamma_X\) are then calculated with the aid of a computer, whenever \(29\le q \le 97\), showing that there are no Bruen chains for \(41 \le q \le 97\). In particular, if \(q\) gets larg…
reviewed by: Francesco Pavese
Mathematics Subject Classification ID: 51E15
Mathematics Subject Classification ID: 51E21
Mathematics Subject Classification ID: 51E23
zbMATH DE Number: 7923266
zbMATH Keywords: Bruen chain
zbMATH Keywords: projective space
zbMATH Keywords: finite field
MaRDI profile type: MaRDI publication profile
cites work: A translation plane of order 81 and its full collineation group
cites work: Inversive geometry and some new translation planes. I
cites work: Bruen chains over fields of small order
cites work: On Bruen chains
cites work: Another Bruen chain
cites work: Bruen chains in PG\((3,p^k)\), \(k\geq 2\)
cites work: An improved branch and bound algorithm for the maximum clique problem
cites work: Example of a chain of circles on an elliptic quadric of PG(3,q),q=7,11
cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
DOI: 10.1016/J.FFA.2024.102491
description: scientific article; zbMATH DE number 7923266