Related papers: The subpower membership problem for bands

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, assume that $G$ has a maximal $A$-invariant subgroup $M$ that is a direct product of some isomorphic simple groups, we prove that if $G$ has a…

A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

The syntactic semigroup problem is to decide whether a given finite semigroup is syntactic or not. This work investigates the syntactic semigroup problem for both the semigroup reducts of $A^+(B_n)$, the affine near-semiring over a Brandt…

It is a classical result that the direct product AxB of two groups is finitely generated (finitely presented) if and only if A and B are both finitely generated (finitely presented). This is also true for direct products of monoids, but not…

In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…

Let $G$ be a finite group and $p^k$ be a prime power dividing $|G|$. A subgroup $H$ of $G$ is called to be $\mathcal{M}$-supplemented in $G$ if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H_iK<G$ for every maximal subgroup…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

We construct a family of representations of an arbitrary variant $S_a$ of a semigroup $S$, induced by a given representation of $S$, and investigate properties of such representations and their kernels.

In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the…

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

Supersolubility of a finite group $G=\langle A,B\rangle$ with the nilpotent derived subgroup $G^\prime$ is established under the condition that the subgroups $A$ and $B$ are both subnormal and supersoluble.

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…