Related papers: The equation solvability problem over nilpotent Ma…
For an infinite group $G$, the poset $\mathcal{L}_G$ of group topologies constitutes a complete lattice. Although $\mathcal{L}_G$ is modular when $G$ is abelian, this property fails to persist for nilpotent groups. Extending Arnautov's 2010…
We derive a generalized Pohozhaev's identity for radial solutions of $p$-Laplace equations, by using the approach in [5], thus extending the work of H. Br\'{e}zis and L. Nirenberg [2], where this identity was implicitly used for the Laplace…
We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that with the only specific exception the solvable radical of a nonsolvable finite group…
We investigate the rectifiable spaces, the Mal'cev algebras, the almost quasivarieties of topological algebraic systems and their free systems and others. It specifies and corrects the roughest mistakes, incorrect statements and nonsense of…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
In this paper we prove the existence of complete, noncompact convex hypersurfaces whose $p$-curvature function is prescribed on a domain in the unit sphere. This problem is related to the solvability of Monge-Amp\`ere type equations subject…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
Gromov claimed, with a sketch of proof, that simply connected nilpotent Lie groups have polynomially bounded filling invariants. The literature establishes this, often with a stronger conclusion where the exponent of polynomiality is…
Let Z{t} be the ring of arithmetic power series that converge on the complex open unit disc. A classical result of Harbater asserts that every finite group occurs as a Galois group over the quotient field of Z{t}. We strengthen this by…
We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…
For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
We describe degenerations of four-dimensional binary Lie algebras, and five- and six-dimensional nilpotent Malcev algebras over \mathbb{C}. In particular, we describe all irreducible components of these varieties.
We establish an equivalence between categories of 'formally nilpotent' Lie algebras and exponential groups in characteristic zero. It extends the equivalences of Mal'cev, Lazard, Quillen and Warfield, and applies to groups under composition…
We prove that any nilpotent regular covering over a compact K\"ahler surface is holomorphically convex if it does not have two ends. Furthermore, we show that the Malcev covering of any compact K\"ahler manifold has at most one end.
In this paper solvable Leibniz algebras with naturally graded non-Lie $p$-filiform $(n-p\geq4)$ nilradical and with one-dimensional complemented space of nilradical are described. Moreover, solvable Leibniz algebras with abelian nilradical…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…
In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$. The vertices of this graph are the elements of $S$ and two…
For a subset $B$ of $\mathbb{R}$, denote by $\operatorname{U}(B)$ be the semiring of (univariate) polynomials in $\mathbb{R}[X]$ that are strictly positive on $B$. Let $\mathbb{N}[X]$ be the semiring of (univariate) polynomials with…