Related papers: The Isomorphism Problem for Computable Abelian p-G…
We give, in Sections 2 and 3, an english translation of: {\it Classes g\'en\'eralis\'ees invariantes}, J. Math. Soc. Japan, 46, 3 (1994), with some improvements and with notations and definitions in accordance with our book: {\it Class…
We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…
Presentations for the holomorphs of abelian groups of the form $C_{p^n} \times 1^{m}$ for $p$=2 or an odd prime are given. These presentations extend the results given in Burnside's well-known text on finite groups on the holomorphs for the…
Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
We consider two variants of those Abelian groups with all proper characteristic subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…
We make explicit some conditions on a semi-abelian category D such that, for any abelian group A in D and any object Y in D, the cohomology group homomorphisms with coefficients in A, induced by the inclusion of the abelian objects of D at…
We describe the graded isomorphisms of rings of endomorphisms of graded flags over graded division algebras. As a consequence describe the isomorphism classes of upper block triangular matrix algebras (over an algebraically closed field of…
For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models…
Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
For a class of nonassociative metagroup algebras their separability is investigated. For this purpose the cohomology theory on them is utilized. Conditions are found under which nonassociative metagroup algebras are separable. Algebras…
A classification, according to invariant theory, of non-constant invariant Abel ODEs known as solvable and found in the literature is presented. A set of new integrable classes depending on one or no parameters, derived from the analysis of…
In 2008, the author proposed a version of duality theory for (not necessarily, Abelian) complex Lie groups, based on the idea of using the Arens-Michael envelope of topological algebra and having an advantage over existing theories in that…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
Finite $p$-groups with a unique $\mathcal{A}_2$-subgroup are classified up to isomorphism. A problem proposed by Berkovich and Janko is solved.
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…