Kuca’s algebraic true complexity conjecture for polynomial progressions

About 3 years old · traced to

Let P1,…,Pm∈Z[y]P_1,\dots,P_m\in\mathbf{Z}[y] be polynomials and let 0≤i≤m0\leq i\leq m. Consider the polynomial progression

x,x+P1(y),…,x+Pm(y).x,x+P_1(y),\dots,x+P_m(y).

An algebraic relation among these entries is an identity

Q0(x)+Q1(x+P1(y))+⋯+Qm(x+Pm(y))=0,Q_0(x)+Q_1(x+P_1(y))+\dots+Q_m(x+P_m(y))=0,

where Q0,…,Qm∈Z[z]Q_0,\dots,Q_m\in\mathbf{Z}[z]. Kuca’s conjecture. The true complexity at ii is the smallest natural number ss such that, for every such algebraic relation satisfied by the progression, the degree of QiQ_i is at most ss. The source presents this as a polynomial-progression analogue of the Gowers–Wolf conjecture and notes that only special cases are known. The conjecture remains open in general.

References

Primary source

Sarah Peluse, “Finite field models in arithmetic combinatorics – twenty years on”, arXiv:2312.08100 (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.