Yang–Chen problem on weighted representation functions
Let . For an integer , a set , and , define . For integers and , let be the number of sets such that for every integer . Determine whether, for every pair of integers , there exists an integer such that for all integers .
References
Primary source
Additional references
- A problem of Yang and Chen on weighted representation functions — arXiv — Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan
Progress summary
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 and eventually agree for all integers .
Known results
- Qu, 2016: the representation function tends to infinity under the eventual-equality hypothesis.
- Shi-Qiang Chen: established a logarithmic lower bound, .
- Chen, Ding, Lü, and Zhang, 2024: proved the stronger bound for every , with the correct linear order.
September 17, 2026 preprint
Li, Xu, and Yan claim that . 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 question negatively, but it remains unverified; earlier weighted representation-function questions have established affirmative and linear-growth results.
Solutions 0
No solutions have been posted yet.