Related papers: Is decidability of the Submonoid Membership Proble…

It is well known that if $G$ is a group and $H$ is a normal subgroup of $G$ of finite index $k$, then $x^k \in H$ for every $x \in G$. We examine finite groups $G$ with the property that $x^k \in H$ for every subgroup $H$ of $G$, where $k$…

We classify by numerical invariants the finite subgroups $H$ of a primary abelian group $G$ for which every homomorphism or monomorphism of $H$ into $G$, or every endomorphism of $H$, extends to an endomorphism of $G$. We apply these…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

The class of finitely presented algebras A over a field K with a set of generators x_{1},...,x_{n} and defined by homogeneous relations of the form x_{i_1}x_{i_2}...x_{i_l}=x_{sigma(i_1)}x_{sigma(i_2)}...x_{sigma(i_l)}, where l geq 2 is a…

Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

Let G be a Lie groupoid with Lie algebroid g. It is known that, unlike in the case of Lie groups, not every subalgebroid of g can be integrated by a subgroupoid of G. In this paper we study conditions on the invariant foliation defined by a…

We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…

Let $G$ be a linear algebraic group over an algebraically closed field of characteristic $p\geq 0$. We show that if $H_1$ and $H_2$ are connected subgroups of $G$ such that $H_1$ and $H_2$ have a common maximal unipotent subgroup and…

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

Let $m,n$ be positive integers and $p$ a prime. We denote by $\nu(G)$ an extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. We prove that if $G$ is a residually finite group satisfying some non-trivial identity $f…

Let $G$ be an amenable group. We define and study an algebra $\mathcal{A}_{sn}(G)$, which is related to invariant means on the subnormal subgroups of $G$. For a just infinite amenable group $G$, we show that $\mathcal{A}_{sn}(G)$ is…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

The subpower membership problem SMP(A) of a finite algebraic structure A asks whether a given partial function from A^k to A can be interpolated by a term operation of A, or not. While this problem can be EXPTIME-complete in general,…

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

Let $K$ be an algebraically closed field of characteristic zero, and let $G$ be a connected reductive algebraic group over $K$. We address the problem of classifying triples $(G,H,V)$, where $H$ is a proper connected subgroup of $G$, and…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…