On the monotonicity of additive representation functions

2019/12/10 by Pascal Stumpf, Stumpf, Pascal
Mathematics · #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1912.04766

openalex publication_date 2019/12/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the monotonicity behavior of three slightly differently defined additive representation functions (as initiated by Erdős, Sárközy and Sós), answering one open question and another one partially, and give a slightly simpler proof for a result of Chen and Tang.

Related

• More about additive representation functions for integers
• Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions
• Operator monotonicity of some functions
• Monotonicity formulas and (S₊)-property: Old and new
• On the maximum values of the additive representation functions