Bart De Bruyn

activity

20102024

most citedOn generalized hexagons of order

(3, t)

and

(4, t)

containing a subhexagon

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2024

Divisible design graphs from the symplectic graph

Bart De Bruyn, Sergey Goryainov, Willem Haemers +1

A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a (group) divisible design. Divisible design graphs were introduced in 2011 as a generalization…

math.CO2024

Characterising ovoidal cones by their intersection numbers

Bart De Bruyn, Geertrui Van de Voorde

In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $PG (4, q)$ which intersects planes in $1$ , $q + 1$ or $2 q + 1$ …

math.CO2023

An infinite family of hyperovals of $Q^{+} (5, q)$ , $q$ even

Bart De Bruyn

We construct an infinite family of hyperovals on the Klein quadric $Q^{+} (5, q)$ , $q$ even. The construction makes use of ovoids of the symplectic generalized quadrangle $W (q)$ that i…

math.CO2016

The $L_{3} (4)$ near octagon

Anurag Bishnoi, Bart De Bruyn

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 pa…

math.CO2016★ 2 cited

On generalized hexagons of order $(3, t)$ and $(4, t)$ containing a subhexagon

Anurag Bishnoi, Bart De Bruyn

We prove that there are no semi-finite generalized hexagons with $q + 1$ points on each line containing the known generalized hexagons of order $q$ as full subgeometries when $q$ i…

math.CO2010

Non-abelian representations of the slim dense near hexagons on 81 and 243 points

B. De Bruyn, B. K. Sahoo, N. S. N. Sastry

We prove that the near hexagon $Q (5, 2) \times L_{3}$ has a non-abelian representation in the extra-special 2-group $2_{+}^{1 + 12}$ and that the near hexagon $Q(5,2) \otimes Q(5…