ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is it true that \alpha\pi1 pGq{\alphaF2 pGq is unbounded?} Jacob Fox This question arises out of current work of Conlon, Fox, Pham, and Yepremyan. Question 11. Let f pnq be the maximum size (number of elements) of a monochro- matic (ignoring 0) linear subspace guaranteed in any 2-coloring of the nonzero elements of Fn2 . Is f pnq “ Opnq? By Ramsey methods such as the Finite Union Theorem, f pnq Ñ 8 as n Ñ 8 (log˚ n lower bound, perhaps more recent work gives finitely many logarithms). Additionally, f pnq “ Opn log nq by considering a random coloring (and it does not do better). Noga Alon has a conjecture about Ramsey Cayley graphs that implies this.}

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.