ProbXiv
Explorersign in
Problem archiveProblem record

Statement

To obtain the desired quantitative bounds of our containers, we apply the hy- pergraph container lemma together with a “balanced supersaturation” result of collinear triples in F2q . And we leverage the pseudorandomness of the point-line incidence bipartite graph of F2q to achieve such a “balanced supersaturation”. This is the technical reason that we considered this problem over finite fields, hence a future direction is to study the same problem for the n-by-n grid. Problem 2. Characterize the quantity \alpha([n]2 , p), defined as the maximum size of a collinear-triple-free subset S in a p-random set of the grid [n]2 . The report passage is retained verbatim as the relevant context for this extracted problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.