Related papers: An algorithm to recognize echelon subgroups of a f…
We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.
We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.
A Magnus subgroup of a one-relator group is the free subgroup freely generated by a proper subset of the generators. Two such subgroups can intersect in the obvious way or in a larger, exceptional way. The condition of non-exceptional…
We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…
We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of $F_n\times F_m$, there is an algorithm that, taking as input a monomorphism and an endomorphism of $F_n\times…
Let $F \ast G$ be a free product of a free group $F$ and a LERF group $G$. In this note, we provide sufficient conditions for a subgroup $H$ of $F \ast G$ to be $\mathcal{A} \cup \mathcal{S}$-separable, that is, for any finite set…
It is known that in any free group the isolator of finitely generated subgroup is finitely generated subgroup. A very simple proof of this statement is proposed.
An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occurs…
We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…
We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.
A subgroup $H$ of a finite group $G$ is said to be an $\mathscr{H}C$-subgroup of $G$ if there exists a normal subgroup $T$ of $G$ such that $G=HT$ and $H^g \cap N_T(H)\leq H$ for all $g\in G$. In this paper, we investigate the structure of…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…
A group $G$ is called a Howson group if the intersection $H\cap K$ of any two finitely generated subgroups $H, K<G$ is again finitely generated, and called a strongly Howson group when a uniform bound for the rank of $H\cap K$ can be…
We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…
We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new…
Let $G$ be a finite group and $H$ a core-free subgroup of $G$. We will show that if there exists a solvable, generating transversal of $H$ in $G$, then $G$ is a solvable group. Further, if $S$ is a generating transversal of $H$ in $G$ and…
This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…