On the Largest intersecting set in GL2(q) and some of its subgroups

Abstract

Let q be a power of a prime number and V be the 2-dimensional column vector space over a finite field Fq. Assume that SL2(V)<G≤ GL2(V). In this paper we prove an Erdos-Ko-Rado theorem for intersecting sets of G and we show that every maximum intersecting set of G is either a coset of the stabilizer of a point or a coset of G w, where G w=\M∈ G:∀ v∈ V, Mv-v∈ w\, for some w∈ V \0\. It is also shown that every intersecting set of G is contained in a maximum intersecting set.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…