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.
Problem statement
Suppose . Then there is so that
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Question context
Let and define Trivial bounds on additive energy are Define
Given this, one can compare various 's. For example by an applications of Holder's inequality one can get
Moreover, there is the following theorem.
Theorem. Fix some . Suppose . then there is a subset , so that
and
Now, using Holder's inequality one can show
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 , we can list all the energies for various , and separate to two cases.
-
Energy always increases (Smoothing.)
-
There is one point that the assumption of the conjecture is satisfied.(Non-smoothing) . The conjecture will give us some structure.
- [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 recordedAttempts 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 notesNotes 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.