Normal closure-finding problem: Difference between revisions

Latest revision as of 20:48, 25 June 2013

This article describes the subgroup operator computation problem for the subgroup operator: normal closure

The normal closure-finding problem is the general name for a class of problems where a group $G$ is described using a group description rule, a subgroup $H$ is described using a subgroup description rule, and our goal is to use a (specified) subgroup description rule to find the normal closure $H^{G}$ .

@@ Line 3: / Line 3: @@
 ==Description==
-We are given a [[group]] <math>G</math> and a [[subgroup]] <math>H</math> specified by some means (typically using [[generating set]]s, though we may also specify them using membership tests). The goal is to obtain a description of the [[normal closure]] <math>K = H^G</math> of <math>H</math> in <math>G</matH> using the same language (so if <math>G</math> and <math>H</math> are described using generating sets, we want a generating set for <math>K</math>, whereas if <math>G</math> and <math>H</math> are described using membership tests, then <math>K</math> is also to be described using a membership test.
+The '''normal closure-finding problem''' is the general name for a class of problems where a group <math>G</math> is described using a [[group description rule]], a [[subgroup]] <math>H</math> is described using a [[subgroup description rule]], and our goal is to use a (specified) [[subgroup description rule]] to find the [[normal closure]] <math>H^G</math>.
 ==Relation with other problems==
@@ Line 9: / Line 9: @@
 ===Problems it reduces to===
-* [[Normality testing problem]]: See [[black-box reduction of normal closure-finding to normality testing]].
+* [[Normality testing problem]]: See [[black-box reduction of normal closure-finding in terms of generating sets to normality testing]].