Related papers: Submonoids and rational subsets of groups with inf…

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.

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

A subgroup Q is commensurated in a group G if each G conjugate of Q intersects Q in a group that has finite index in both Q and the conjugate. So commensurated subgroups are similar to normal subgroups. Semistability and simple connectivity…

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…

Fix a finite semigroup $S$ and let $a_1, \ldots, a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1, \ldots, a_k$. For combinatorial Rees matrix semigroups we…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

For every finite abelian group $G$, there are positive integers $n$ and $d$ such that $G$ is isomorphic to the multiplicative group of $d$-th powers of reduced residues modulo $n$.

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

In this article we develop the theory of residually finite rationally $p$ (RFR$p$) groups, where $p$ is a prime. We first prove a series of results about the structure of finitely generated RFR$p$ groups (either for a single prime $p$, or…

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

It is proved that for any natural number $n$ the subalgebra of a free finitely generated alternative algebra generated by all the words on generators whose length is a multiple of $n$ (the Veronese $n$-subalgebra), is finitely generated.

We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…

We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…