The nn-dimensional finite-field (Uk)(U_k)-pattern conjecture

About 6 years old · traced to

Fix a prime pp and let πp:Z→Fp\pi_p:\mathbb{Z}\to\mathbb{F}_p be the canonical projection. For U⊂ZU\subset\mathbb{Z}, a UU-pattern in Fpn\mathbb{F}_p^n is a set of the form x+πp(U)⋅rx+\pi_p(U)\cdot r with x,r∈Fpnx,r\in\mathbb{F}_p^n and r≠0r\ne0. Let (Uk)(U_k) be a sequence with ∣Uk∣=k|U_k|=k, and let gn,Uk(p)g_{n,U_k}(p) be the size of the smallest set containing a UkU_k-pattern with basepoint xx for every x∈Fpnx\in\mathbb{F}_p^n. The nn-dimensional finite-field (Uk)(U_k)-pattern conjecture.

lim⁡k→∞lim⁡p→∞log⁡gn,Uk(p)log⁡p=n.\lim_{k\to\infty}\lim_{p\to\infty}\frac{\log g_{n,U_k}(p)}{\log p}=n.

This is technically a family indexed by nn and by the sequence (Uk)(U_k). The supplied text does not state any resolution or further consequences.

References

Primary source

Charlie Cowen-Breen, Elene Karangozishvili, Narmada Varadarajan and Thomas Wang, “Pattern Problems related to the Arithmetic Kakeya Conjecture”, arXiv:2011.07056 (2020).

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.