Monotonicity of the number of functions determined by additive relations

About 10 years old · traced to

Let EE be a set and SS a set of arithmetic functions. For positive integers kk and ellell, let n(E,S,k)n(E,S,k) denote the number of functions in SS determined by the relation

f(a1+a2+⋯+ak)=f(a1)+f(a2)+⋯+f(ak)f(a_1+a_2+\dotsb+a_k)=f(a_1)+f(a_2)+\dotsb+f(a_k)

for arbitrary ai∈Ea_i\in E. The monotonicity conjecture for n(E,S,k)n(E,S,k). If EE and SS determine n(E,S,k)n(E,S,k) in this way, then

n(E,S,k)≥n(E,S,ℓ)n(E,S,k)\ge n(E,S,\ell)

when k≤ℓk\le \ell. The paper describes this as a generalization of the preceding conjecture, and gives no resolution.

References

Primary source

Poo-Sung Park, “k-additive uniqueness of the set of squares for multiplicative functions”, arXiv:1612.00897 (2016).

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.