Hyper-reguli in PG(5,q)
S.G. Barwick, Wen-Ai Jackson

TL;DR
This paper proves that in projective space PG(5,q), an André hyper-regulus has exactly two switching sets and characterizes the planes intersecting these sets, providing a counting-based proof.
Contribution
It establishes the precise number of switching sets for André hyper-reguli in PG(5,q) using a simple counting argument, clarifying their geometric structure.
Findings
Exactly two switching sets for André hyper-reguli in PG(5,q)
Number of planes meeting each hyper-regulus in a point is 2(q^2+q+1)
Counting argument confirms the structure of these hyper-reguli
Abstract
A simple counting argument is used to show that for all , an Andr\'e hyper-regulus in has exactly two switching sets. Moreover, there are exactly planes in that meet every plane of in a point, namely the planes in the switching sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Chronic Myeloid Leukemia Treatments
