Related papers: Subgroup and Coset Intersection in abelian-by-cycl…

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

We construct spherical subgroups in infinite-dimensional classical groups $G$ (usually they are not symmetric and their finite-dimensional analogs are not spherical). We present a structure of a semigroup on double cosets $L\setminus G/L$…

Let $G = \langle A,B \rangle$ be a non-elementary two generator subgroup of the isometry group of $\mathbb{H}^2$, the hyperbolic plane. If $G$ is discrete and free and geometrically finite, its quotient is a pair of pants and in prior work…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…

An interesting question about quasiconvexity in a hyperbolic group concerns finding classes of quasiconvex subsets that are closed under finite intersections. A known example is the class of all quasiconvex subgroups. However, not much is…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…

The topological group version of the celebrated Banach-Mazur problem asks wether every infinite topological group has a non-trivial separable quotient group. It is known that compact groups have infinite separable metrizable quotient…

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is…

A subset $X$ of an Abelian group $G$ is called $midconvex$ if for every $x,y\in X$ the set $\frac{x+y}2=\{z\in G:2z=x+y\}$ is a subset of $X$. We prove that a subset $X$ of an Abelian group $G$ is midconvex if and only if for every $g\in G$…

Let $G$ be a finite group. We will say that $M$ and $S$ form a \textsl{complete splitting} (\textsl{splitting}) of $G$ if every element (nonzero element) $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$,…

Baer characterized capable finite abelian groups (a group is capable if it is isomorphic to the quotient of some group by its center) by a condition on the size of the factors in the invariant factor decomposition (the group must be…

The Subgroup Isomorphism Problem for Integral Group Rings asks for which finite groups U it is true that if U is isomorphic to a subgroup of V(ZG), the group of normalized units of the integral group ring of the finite group G, it must be…

We consider semigroup algorithmic problems in the wreath product $\mathbb{Z} \wr \mathbb{Z}$. Our paper focuses on two decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain the…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

We show that the subset sum problem, the knapsack problem and the rational subset membership problem for permutation groups are NP-complete. Concerning the knapsack problem we obtain NP-completeness for every fixed $n \geq 3$, where $n$ is…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…