ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 1.2 (T. Tao). Is there a hypergraph regularity lemma for subsets of pseu-dorandom sparse hypergraphs of large density? If so, it would give a new proof that there are arbitrarily long arithmetic progressions among the primes, which may possi-bly extend to a more general situation. The following analogue for graphs is known: If

|A| = |B| = N, G0 ⊆ A × B is "sparsely c(≤, δ )-quasirandom", G ⊂ G0, |G| > δ |G0|,then there exist equitable partitions

A = A1 ∪ · · · ∪ As, B = B1 ∪ · · · ∪ Bt,

where s, t < C (≤, δ ), such that for (1 − ≤)st of the pairs ( i, j ) the restriction of G to

Ai × Bj is ≤-regular relative to G0.

12COLLECTED BY ERNIE CROOT AND VSEVOLOD F. LEV

The presenter remarks that despite being a generalization of the already rather diffi-cult hypergraph regularity lemmas, if done correctly the proof of such a result may be

easier than that of the existing regularity lemmas. This is because the induction used to prove such lemmas may be cleaner.

Record

Added
Links

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.