Maximal skew sets of lines on a Hermitian surface and a modified Bron-Kerbosch algorithm
Algebraic Geometry
2022-12-01 v1
Abstract
In this paper, we study maximal sets of skew lines on Hermitian surfaces. We give a new algorithm to compute these sets and give some computational results for Hermitian surfaces of degrees 3,4, and 5. In more generality, this algorithm solves a new variant of the clique listing problem, which may be more approachable than the classical problem. Finally, we explicitly construct a large skew set of lines on Hermitian varieties of any degree and use it to give a lower bound on the largest size of maximal skew sets and a lower bound on the possible number of maximal skew sets.
Keywords
Cite
@article{arxiv.2211.16580,
title = {Maximal skew sets of lines on a Hermitian surface and a modified Bron-Kerbosch algorithm},
author = {Anna Brosowsky and Haoyu Du and Madhav Krishna and Sandra Nair and Janet Page and Tim Ryan},
journal= {arXiv preprint arXiv:2211.16580},
year = {2022}
}
Comments
12 pages, comments welcome