Generalized exponential polynomial conjecture for mixed additive-function equations

Let nn be a positive integer, let FC\mathbb{F}\subset\mathbb{C} be a field, and let p1,,pn,q1,,qnp_{1},\ldots,p_{n},q_{1},\ldots,q_{n} be fixed positive integers satisfying conditions C(i)--C(iii). Let f1,,fn,g1,,gn ⁣:FCf_{1},\ldots,f_{n},g_{1},\ldots,g_{n}\colon\mathbb{F}\to\mathbb{C} be additive functions satisfying the mixed equation from the paper. A function is a generalized exponential polynomial function of degree at most n1n-1 if it has the corresponding finite exponential-polynomial representation of that degree. Generalized exponential polynomial conjecture. Every function fif_i and gig_i is a generalized exponential polynomial function of degree at most n1n-1. In particular, if

fi(x)=Di(x),gi(x)=D~i(x)(xF×),f_i(x)=D_i(x),\qquad g_i(x)=\widetilde{D}_i(x)\qquad (x\in\mathbb{F}^{\times}),

for derivations DiD_i and D~i\widetilde{D}_i, then the orders of DiD_i and D~i\widetilde{D}_i are at most n1n-1. This conjecture would describe the full solution class of the mixed additive-function equation and would, in particular, bound the orders of derivations occurring among its solutions.

Sources & referencesView supporting material

Primary source

Eszter Gselmann and Gergely Kiss, “Polynomial equations for additive functions II”, arXiv:2303.03306 (2023).

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.