OpenFrontiers
← Back to the index
OP-7581Status unassessedCombinatorics

A conjecture about generalized additive energy

Additive combinatorics and its applications · Historical workshop question

Editorial mapping of AIMPL source category: Combinatorics. http://aimpl.org/addcombapp/ Not an author-supplied MSC code.

Historical list · status unassessedAs of 2026-09-08Source & evidence ↓

Problem statement

Suppose ρ2n+2n−1n(A)<Kρ2n(A)\rho_{2n+2}^{\frac{n-1}{n}}(A)< K\rho_{2n}(A). Then there is H⊂(n−1)A,∣H∣≥ρ2n1n−1KcH\subset (n-1)A, |H|\geq \frac{\rho_{2n}^{\frac{1}{n-1}}}{K^c} so that E4(H)≥∣H∣3∣A∣εKc′.E_4(H)\geq \frac{|H|^3}{|A|^{\varepsilon}K^{c'}}.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Question context

Let A⊂GA\subset G and define E2n(A)=∣{(a1,⋯ ,an)∈A2n:a1+⋯+an=an+1+⋯+a2n}∣.E_{2n}(A) = |\{(a_1,\cdots,a_n)\in A^{2n}: a_1+\cdots+a_n = a_{n+1}+\cdots+a_{2n}\}|. Trivial bounds on additive energy are ∣A∣n≤E2n(A)≤∣A∣2n−1.|A|^n\leq E_{2n}(A)\leq |A|^{2n-1}. Define ρ2n(A)=E2n(A)∣A∣n.\rho_{2n}(A)= \frac{E_{2n}(A)}{|A|^n}.

Given this, one can compare various ρk\rho_k's. For example by an applications of Holder's inequality one can get

ρ8(A)≥ρ43(A).\rho_8(A) \geq \rho_4^3(A).

Moreover, there is the following theorem.

Theorem. Fix some 0<ε<10<\varepsilon<1. Suppose ρ8(A)≤Kρ43(A)\rho_8(A)\leq K\rho_4^3(A). then there is a subset H⊂AH\subset A, so that

∣H∣≥ρ4(A)/Kc|H|\geq \rho_4(A)/K^c and E4(H)≥∣H∣3∣A∣εKc′.E_4(H)\geq \frac{|H|^3}{|A|^{\varepsilon}K^{c'}}.

Now, using Holder's inequality one can show

ρ2n≤ρ2n+2n−1n.\rho_{2n}\leq \rho_{2n+2}^{\frac{n-1}{n}}.

Progress & source assessment

Historical workshop record. Current open/solved status has not been independently reassessed.

Status note in the source

This conjecture has applications to PFR. In fact, given a set AA , we can list all the energies for various nn, and separate to two cases.

  1. Energy always increases (Smoothing.)

  2. There is one point that the assumption of the conjecture is satisfied.(Non-smoothing) . The conjecture will give us some structure.

References
  1. [1]Additive combinatorics and its applications link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.