Large cliques in extremal incidence configurations
Abstract
Let P ⊂ R2 be a Katz-Tao (δ,s)-set, and let L be a Katz-Tao (δ,t)-set of lines in R2. A recent result of Fu and Ren gives a sharp upper bound for the δ-covering number of the set of incidences I(P,L) = \(p,) ∈ P × L : p ∈ \. In fact, for s,t ∈ (0,1], |I(P,L)|δ ε δ-ε -f(s,t), ε > 0, where f(s,t) = (s2 + st + t2)/(s + t). For s,t ∈ (0,1], we characterise the near-extremal configurations P × L of this inequality: we show that if |I(P,L)|δ ≈ δ-f(s,t), then P × L contains "cliques" P' × L' satisfying |I(P',L')|δ ≈ |P'|δ|L'|δ, |P'|δ ≈ δ-s2/(s + t) and |L'|δ ≈ δ-t2/(s + t).
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.