There was a question whether associative, but non-commutative binary operation over the real numbers exist. A trivial answer is the binary operation $x\circ y = x$ or $x\circ y = y$.
As a followup, there was another question, which specifically excluded trivial binary operations of the type $x\circ y = f(x)$ and $x\circ y = g(y)$ and also requiring it to be continuous (almost) everywhere. One answer was $x\circ y = \vert x \vert y$. None of the answers (so far) provided an analytic function.
So, the question is whether there is a binary operation $\circ:S \to \mathbb R$ (where $S \subseteq \mathbb R\times \mathbb R$) which is:
- associative: $(x \circ y) \circ z = x \circ (y \circ z)$
- non-commutative: $\exists (x,y)$ such that $x \circ y \ne y \circ x$
- non-trivial: $\nexists f(x)$ such that $x\circ y = f(x)$ or $x\circ y= f(y)$
- analytic: $$x \circ y = \sum_{m,n=0}^\infty a_{mn}(x-x_0)^m (y-y_0)^n$$