An analogue of the Erdos-Stone theorem for finite geometries

Abstract

For a set G of points in (m-1,q), let q(G;n), denote the maximum size of a collection of points in (n-1,q) not containing a copy of G, up to projective equivalence. We show that \[n→ ∞ q(G;n)|(n-1,q)| = 1-q1-c,\] where c is the smallest integer such that there is a rank-(m-c) flat in (m-1,q) that is disjoint from G. The result is an elementary application of the density version of the Hales-Jewett Theorem.

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…