Given $k$, $f(x) = e^{x_1}+e^{x_1+x_2}+\cdots+e^{x_1+x_2+\cdots+x_k},$ $x=(x_1,x_2,\ldots,x_k),$ where $x_i \in \{0,1\}$.
We want to compute: $\inf_{x \neq y}|f(x)-f(y)|$ or a lower bound of $\inf_{x \neq y} |f(x)-f(y)|$.
Now I just know that $f$ is an injection when $x$ is rational. Anyone know if there is an analytic solution of this?
Evaluating the minimum $\delta_k:=\min_{x\neq y}|f(y)-f(x)|$ over distinct strings $x, y\in \{0,1\}^k$ seems a hard diophantine problem. It is quite cheap to prove that $\delta_k$ is $O(1/k)$ and decreasing, so that in particular the infimum over all finite strings is zero; actually, it's zero even among strings $x$ and $y$ with at most $2$ non-zero coordinates.
For positive integers $p,q$ consider the strings $x:=1\ 0^{p+q}$ and $y:=0^q\ 1^2\ 0^{p-1}$ of length $k:=p+q+1$. One has $f(x)=(p+q+1)e$ and $f(y)=q+e+pe^2$, so $fy)-f(x)=pe^2-(p+q)e+q=(e-1)(pe-q)$. By Dirichlet's approximation theorem, $|pe-q|$ can be made less than $1/n$ by some $1\le q\le n$, and $p=O(q)$, from which it follows $\delta_k=O(1/k)$.
I'm confused. Why not $x = 0$ and $y=(0, 0, \ldots , 0, 1)$? This has $f(y) - f(x) = e -1$, which is clearly best possible [though not unique]. (As you note, $f$ is an injection, so different strings must have at least one of these summands different, and the closest they can be is $e^1 - e^0$.)
Edit: as pointed out in the comments, the above is by no means a proof. (All the same, I still put it forward as a conjecture.)
Second edit: I now see (again from the comments) that the above conjecture is not at all correct, and the problem is still very much open!
