arXiv subjects
Publications and source records attributed to Alexey Kanel-Belov.
In a recent paper "Solvability of equations in elementary functions" [arXiv:1911.10409] the insolvability in elementary functions of equation $\tan(x) - x = a$ was proved. This work applies the same topological method to prove the insolvability of equation $x^x = a$.
This is the second paper devoted to construction of finitely presented infinite nil semigroup with identity $x^9=0$. This construction answers to the problem of Lev Shevrin and Mark Sapir. In the first part we constructed the sequence of complexes with some set of properties. Namely, all these complexes are uniform elliptic: any two points $A$ and $B$ with distance $d$ can be connected with a system of shortest paths forming a disk of width $ λ\cdot D $ for some global constant $ λ> 0 $. In the second part of the proof, a finite system of colors with determinism is introduced: for each minimum square that the complex consists of, the color of the three angles determines the color of the fourth corner. The present paper is devoted to the second part of the proof.
This paper is devoted to construction of finitely presented infinite nil semigroup with identity $x^9=0$. This construction answers to the problem of Lev Shevrin and Mark Sapir. The paper is quite long so the proof is separated into geometric, combinatorial and finalization parts. In the first part we construct uniformly elliptic space. Space is called {\it uniformly elliptic} if any two points $A$ and $B$ at the distance of $D$ can be connected by the system of geodesics which form a disc with width $λ\cdot D$ for some global constant $λ>0$. In the second part we study combinatorial properties of the constructed complex. Vertices and edges of this complex coded by finite number of letters so we can consider semigroup of paths. Defining relations correspond to pairs of equivalent short paths on the complex. Shortest path in sense of natural metric correspond nonzero words in the semigroup. Words which are not presented as paths on complex and words correspond to non shortest paths can be reduced to zero. In the third part we make a finalization. In particular, we show that word containing ninth degree word can be reduced to zero by defining relations. The present paper contains first part of the proof. This work was carried out with the help of the Russian Science Foundation Grant N 17-11-01377. The first author is the winner of the contest Young Mathematics of Russia .
This paper is devoted to construction of finitely presented infinite nil semigroup with identity $x^9=0$. This construction answers to the problem of Lev Shevrin and Mark Sapir. This is the short version of the paper presenting the main ideas of the construction. The work was carried out with the help of the Russian Science Foundation Grant N 17-11-01377. The first author is the winner of the contest Young Mathematics of Russia .
We prove that the equation $\tan(x) - x = a$ is unsolvable in elementary functions
The paper deals with the solution of Shevrin ans Sapir problem. Infinite finitely presented nilsemigroup is constructed. The construction is based on aperiodic tilings, Goodman-Strauss type theorems on uniformly elliptic space. Space is called {\it uniformly elliptic} iff there is universal constant $λ>0$ such that any two points $A$ and $B$ on distant $D$ can be joined by family of geodesic lines generating a disc of wideness $λ\cdot D$. Research was supported by the grant RFBR N 14-01-00548
We give a brief survey of recent results on word maps on simple groups and polynomial maps on simple associative and Lie algebras. Our focus is on parallelism between these theories, allowing one to state many new open problems and giving new ways for solving older ones.
Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in a quadratically closed field $K$ of any characteristic. It has been conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is either zero, or the set of scalar matrices, or the set $sl_n(K)$ of matrices of trace 0, or all of $M_n(K)$. We prove the conjecture for $n=2$.