Forbidden Intersection Theorems for Matrix Spaces
Abstract
A family of m × n matrices F ⊂eq Fqm × n is (t-1)-intersection-free if (A-B) ≠ t-1 for all A,B ∈ F. A forbidden (t-1)-intersection problem for a collection of matrices asks for the size and structure of extremal (t-1)-intersection-free families within that collection. We solve this problem in GL(n,q) for all pairs (n,t) such that t<c· n where c is a universal constant. We show that the t-umvirates and their duals, are the only maximal (t-1)-intersection-free families F ⊂ GL(n,q). Here, a t-umvirate is defined as the family of all matrices that agree on a fixed t-dimensional subspace, and its dual as those whose transposes agree on it. The best previously known result, due to Ellis, Kindler, and Lifshitz, established this bound under the assumption n ≥ eCt t for some constant C>0. We also give Frankl--Rödl-type constructions showing that this range of t is almost the best possible: we show that for values of t>n/2 the extremal behavior changes and no clean analogue is expected. Our proof builds upon recent global hypercontractivity results for matrix spaces due to Evra, Kindler, and Lifshitz, and broadly applies to any sufficiently dense class of matrices.
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.