Asymptotic direct sum conjecture for partition rank

Let d2d\geq 2, let qq be a prime power, and let TFqn1FqndT\in\mathbb{F}_q^{n_1}\otimes\cdots\otimes\mathbb{F}_q^{n_d}. For n1n\geq 1, let TnT^{\oplus n} denote the nn-fold direct sum of TT. Asymptotic direct sum conjecture for partition rank. There exists a constant CC(d,q)>0C\coloneqq C(d,q)>0 such that

PRFq(T)Clim supnPRFq(Tn)n.\operatorname{PR}_{\mathbb{F}_q}(T)\leq C\limsup_{n\to\infty}\frac{\operatorname{PR}_{\mathbb{F}_q}(T^{\oplus n})}{n}.

The paper presents this as another conjectural formulation and later states that it is equivalent to the preceding partition-rank conjectures; no resolution of the common conjecture is supplied.

Sources & referencesView supporting material

Primary source

Qiyuan Chen and Ke Ye, “Stability of ranks under field extensions”, arXiv:2409.04034 (2025).

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.