← All problems

The equivalence of Host–Kra, Weyl, true and algebraic complexity

5 years old · traced to

Let t∈N+t\in\mathbb{N}_+ and let P⃗∈R[x,y]t+1\vec{P}\in\mathbb{R}[x,y]^{t+1} be an integral polynomial progression. For each 0⩽i⩽t0\leqslant i\leqslant t, let HKi(P⃗)\mathcal{HK}_i(\vec{P}), Wi(P⃗)\mathcal{W}_i(\vec{P}), Ti(P⃗)\mathcal{T}_i(\vec{P}), and Ai(P⃗)\mathcal{A}_i(\vec{P}) denote respectively the Host–Kra, Weyl, true, and algebraic complexities at ii. Complexity-equivalence conjecture. Then

HKi(P⃗)=Wi(P⃗)=Ti(P⃗)=Ai(P⃗)⩽t−1.\mathcal{HK}_i(\vec{P})=\mathcal{W}_i(\vec{P})=\mathcal{T}_i(\vec{P})=\mathcal{A}_i(\vec{P})\leqslant t-1.

The four notions measure, respectively, the characteristic-factor, higher-order Fourier-analytic, finitary Gowers-norm, and algebraic complexity of a polynomial progression. The conjecture would give a purely algebraic criterion for determining the smallest Host–Kra factor or the smallest Gowers norm controlling the progression.

References
  1. Borys Kuca, “On several notions of complexity of polynomial progressions”, arXiv:2104.07339 (2021).

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.