Yang–Chen problem on weighted representation functions

Let N={0,1,2,…}\mathbb N=\{0,1,2,\ldots\}. For an integer k>1k>1, a set A⊆NA\subseteq\mathbb N, and n∈Nn\in\mathbb N, define R1,k(A,n)=#{(a1,a2)∈A2:a1+ka2=n}R_{1,k}(A,n)=\#\{(a_1,a_2)\in A^2:a_1+ka_2=n\}. For integers k>1k>1 and t≥1t\ge 1, let fk(t)f_k(t) be the number of sets A⊆NA\subseteq\mathbb N such that R1,k(A,n)=R1,k(N∖A,n)R_{1,k}(A,n)=R_{1,k}(\mathbb N\setminus A,n) for every integer n≥tn\ge t. Determine whether, for every pair of integers k,l>1k,l>1, there exists an integer t0t_0 such that fk(t)=fl(t)f_k(t)=f_l(t) for all integers t≥t0t\ge t_0.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

A September 2026 preprint claims to settle the question negatively by showing that the number of solutions grows at different rates for different weights, but the result has not been independently verified.

Yang and Chen posed related weighted representation-function questions in 2012. The newer question asks whether the counting functions fk(t)f_k(t) and fl(t)f_l(t) eventually agree for all integers k,l>1k,l>1.

Known results

  • Qu, 2016: the representation function tends to infinity under the eventual-equality hypothesis.
  • Shi-Qiang Chen: established a logarithmic lower bound, lim inf⁡n→∞r1,k(A,n)/log⁡n>0\liminf_{n\to\infty}r_{1,k}(A,n)/\log n>0.
  • Chen, Ding, Lü, and Zhang, 2024: proved the stronger bound lim inf⁡n→∞r1,k(A,n)/n>0\liminf_{n\to\infty}r_{1,k}(A,n)/n>0 for every k≥2k\ge 2, with the correct linear order.

September 17, 2026 preprint

Li, Xu, and Yan claim that fk(t)≍k2t/tk/2f_k(t)\asymp_k 2^t/t^{k/2}. This gives a negative answer to the eventual-equality question for different weights and is currently an unrefereed preprint.

Current status (as of September 2026): The claimed asymptotic formula would settle the fk(t)f_k(t) question negatively, but it remains unverified; earlier weighted representation-function questions have established affirmative and linear-growth results.

Sources

Solutions 0

No solutions have been posted yet.