On the maximum intersecting sets of the general semilinear group of degree 2
Abstract
Let p be a prime and q = pk. A subset F ⊂ L2(q) is intersecting if any two semilinear transformations in F agree on some non-zero vector in Fq2. We show that any intersecting set of L2(q) is of size at most that of a stabilizer of a non-zero vector, and we characterize the intersecting sets of this size. Our proof relies on finding a subgraph which is a lexicographic product in the derangement graph of L2(q) in its action on non-zero vectors of Fq2. This method is also applied to give a new proof that the only maximal intersecting sets of GL2(q) are the maximum intersecting sets.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.