Polynomial method via tensorizing
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
Let be either or . Let be a tensor, and is the identity tensor on the same space as . Suppose . Is it true that for some constant ?
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
The purpose of this problem is to extend the current polynomial method techniques to handle 4APs and more complicated patterns. It's about suggesting a notion of tensor rank that tensorizes. Let be a field and be a -dimensional tensor. We can think of as a multilinear polynomial on variables where specifies the coefficients of the monomials. In the following we introduce several notions of rank. Let be the minimum number of rank-one tensors that sum up to . We need to specify the definition of a rank-one tensor. There are several definitions of a rank-1 tensor .
-1:
where each is linear
-1: There is some so that
where is linear and does not depend on .
-1: There is a subset so that
Note that . We introduce another notion of rank (only for , where is prime) called analytic rank. Let where is a th root of unity. Also note that . Define We have that .
Now, let's see how these notions of rank are used to solve, say the capset problem. The idea is that the identity tensor has high rank for all definitions of , but the capset tensor has low rank. The capset tensor is where for some . Given we have if and is 1 otherwise. If is -free, then ( restricted to the set ) is identity.
Progress & source assessment
Historical workshop record. Current open/solved status has not been independently reassessed.
Status note in the source
This is known if is chosen to be . Also, this problem, if true, has several consequences such as exponential upper bounds on size of -free sets. More generally, it would be great to find any useful notion of rank that tensorizes.
- [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.