Related papers: Complexity of Finite Semigroups: History and Decid…
The classification of the finite subgroups of $\mathrm{GL}_n(\mathbb{C})$ and $\mathrm{PGL}_n(\mathbb{C})$ is a classical problem in the field of finite group theory, dating back to the late 19th century with authors like Klein, Jordan,…
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. First, by strengthening results of Bou-Rabee and Seward and also…
The purpose of this paper is to begin studying the computation of the nonzero determinant of semigroups within the class of finite semigroups that possesses a pair of non-commutative idempotents. This paper focuses on a class of these…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
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}$…
Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
Let $G$ be a finitely presented group. A new complexity called \textit{Karoubi-Weibel complexity} or \textit{covering type}, is defined for $G$. The construction is inspired by recent work of Karoubi and Weibel \cite{KW}, initially applied…
Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…
PhD thesis concerning cohomological finiteness conditions of infinite discrete groups. Much of the material in this thesis has also appeared in arXiv:1311.7629, arXiv:1310.6262, arXiv:1311.6156, and arXiv:1207.1597.
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…