On the maximum intersecting sets of the general semilinear group of degree
arXiv:2402.17687
Abstract
Let be a prime and . A subset is intersecting if any two semilinear transformations in agree on some non-zero vector in . We show that any intersecting set of 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 in its action on non-zero vectors of . This method is also applied to give a new proof that the only maximal intersecting sets of are the maximum intersecting sets.