Forbidden intersection problems for families of linear maps

Abstract

We study an analogue of the Erdos-S\'os forbidden intersection problem, for families of linear maps. If V and W are vector spaces over the same field, we say a family F of linear maps from V to W is (t-1)-intersection-free if for any two linear maps σ1,σ2 ∈ F, (\v ∈ V:\ σ1(v)=σ2(v)\) ≠ t-1. We prove that if n is sufficiently large depending on t, q is any prime power, V is an n-dimensional vector space over Fq, and F ⊂ GL(V) is (t-1)-intersection-free, then |F| ≤ Πi=1n-t(qn - qi+t-1). Equality holds only if there exists a t-dimensional subspace of V on which all elements of F agree, or a t-dimensional subspace of V* on which all elements of \σ*:\ σ ∈ F\ agree. Our main tool is a `junta approximation' result for families of linear maps with a forbidden intersection: namely, that if V and W are finite-dimensional vector spaces over the same finite field, then any (t-1)-intersection-free family of linear maps from V to W is essentially contained in a t-intersecting junta (meaning, a family J of linear maps from V to W such that the membership of σ in J is determined by σ(v1),…,σ(vM),σ*(a1),…,σ*(aN), where v1,…,vM ∈ V, a1,…,aN ∈ W* and M+N is bounded). The proof of this in turn relies on a variant of the `junta method' (originally introduced by Dinur and Friedgut, and powefully extended by Keller and the last author), together with spectral techniques and a hypercontractive inequality.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…