Every sum-free set A in F_5^n with |A| at least 28 times 5 to the n-3 is either in two parallel hyperplanes or isomorphic to a specific 28-element sum-free set in F_5^3 times the lower-dimensional space.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
The chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of its incidence graph, via an elementary matching argument in symmetric designs.
Exposition of the result that Boolean degree one functions on J_q(n,k) are trivial when min(k,n-k) >= 2 and n is large enough.
citing papers explorer
-
Large sum-free sets in finite vector spaces II
Every sum-free set A in F_5^n with |A| at least 28 times 5 to the n-3 is either in two parallel hyperplanes or isomorphic to a specific 28-element sum-free set in F_5^3 times the lower-dimensional space.
-
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
The chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of its incidence graph, via an elementary matching argument in symmetric designs.
-
Boolean degree one functions on the Grassmann scheme
Exposition of the result that Boolean degree one functions on J_q(n,k) are trivial when min(k,n-k) >= 2 and n is large enough.