Related papers: Groups with undecidable word problem and almost qu…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
In this paper we study obstructions to presentability by products for finitely generated groups. Along the way we develop both the concept of acentral subgroups, and the relations between presentability by products on the one hand, and…
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}$…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
Baumslag's group is a finitely presented metabelian group with a Z \wr Z subgroup. There is an analogue with an additional torsion relation in which this subgroup becomes C_m \wr Z. We prove that Baumslag's group has an exponential Dehn…
We prove that the Bridson-Dison group has quartic Dehn function, thereby providing the first precise computation of the Dehn function of a subgroup of a direct product of free groups with super-quadratic Dehn function. We also prove that…
We establish three results dealing with the character varieties of finitely generated groups. The first two are concerned with the behavior of $\dim X_n(\Gamma)$ as a function of $n$, and the third addresses the problem of realizing a…
We determine the finite groups whose real irreducible representations have different degrees.
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…