The constant-factor equivalence conjecture for partition and analytic rank

About 5 years old · traced to

Let kk-tensors be tensors TT over a finite field FF, with partition rank PR⁡(T)\operatorname{PR}(T) and analytic rank AR⁡(T)\operatorname{AR}(T).

Constant-factor equivalence conjecture. For every kge2k ge 2 there is a constant C=C(k)C=C(k) such that, for every finite field FF and every kk-tensor TT over FF,

PR⁡(T)≤C⋅AR⁡(T).\operatorname{PR}(T) \le C\cdot\operatorname{AR}(T).

The conjecture asserts that the structure measured by partition rank and the randomness measured by analytic rank are equivalent up to a constant factor. The inequality AR⁡(T)≤PR⁡(T)\operatorname{AR}(T)\le\operatorname{PR}(T) is known, and polynomial upper bounds for partition rank in terms of analytic rank are available, but this uniform linear bound remains open in the stated generality.

References

Primary source

Alex Cohen and Guy Moshkovitz, “Partition and Analytic Rank are Equivalent over Large Fields”, arXiv:2102.10509 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.