SearcharxivSearch

arXiv · 2602.09253

Solvability of meromorphic equations in elementary functions

Abstract

An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations (addition, subtraction, multiplication, and division), the exponential function, the complex logarithm, and constants. Specific functions such as $\tan x - x$, $\exp x + x$, $x^x$ have been proven to be unsolvable by Kanel-Belov, Malistov, Zaytsev, while almost all entire surjective functions of at most exponential growth have been covered by Zelenko. All these rely on one-dimensional topological Galois theory, developed by Khovanskii. We generalize to provide a proof for the unsolvability of all elementary meromorphic functions $f$ such that the derivative of $f$ has infinitely many roots $x_i$ and the set of distinct values $f(x_i)$ is infinite.

Explore related subjects

Keep this discovery

BibTeXRIS

Miroslav Marinov, Nikola Veselinov. 2026-02-09. Solvability of meromorphic equations in elementary functions. https://arxiv.org/abs/2602.09253

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR