# Set-stabilizer in a nilpotent group problem

*This article describes a group-finding problem, that is, a problem where we have to explicitly find a generating set of a group that is specified through certain conditions*

This is a variation of set-stabilizer problem|Find other variations of set-stabilizer problem |

## Contents

## Description

### Given data

A nilpotent group acts faithfully on a set , and it is described by a generating set . We are given a subset .

### Goal

We need to find the set-stabilizer of in , that is, the set of elements of that stabilize .

## Solution

### Outline

Since is nilpotent, is the direct product of its Sylow subgroups. Further, the stabilizer of in , being a subgroup of , is also a direct product of *its* Sylow subgroups, hence it suffices to find the Sylow subgroups of the stabilizer. Further, the Sylow subgroups of the stabilizer are the same as the stabilizers in the Sylow subgroups.

That is, if is a prime and is a -Sylow subgroup of then is the -Sylow subgroup of .

We thus need to do the following:

- Find all the Sylow subgroups of
- Find the set-stabilizer in each Sylow subgroup
- Take the direct product of those (or simply, take the union of the generating sets)

### Finding all the Sylow subgroups

This is easily achieved by looking at the original generating set and *projecting* onto the Sylow subgroups.

### Finding the set stabilizer in each Sylow subgroup

- Construct a structure forest for . Such a structure forest must be a union of complete binary trees.
- Now, pair together structure trees of the same size, to get a complete -ary tree with depth 1 more. Keep doing this pairing procedure (like binary addition) till all the trees have different sizes
- Thus, obtain trees of different sizes. The automorphism group of this new forest is a Sylow . Call this Sylow subgroup .
- For all the vertices in , attach a long gadget (say a path) from these vertices, in such a way that the only permissible automorphisms of the new tree (after attaching these gadgets) are automorphisms that send vertices of to among themselves.
- Having put these gadgets, compute the automorphism group of the forest along with these gadgets. This can easily be done as it is a special case of finding the automorphism group of a rooted forest. Call this automorphism group .

We now have a situation where:

- sits inside a 2-Sylow subgroup
- There exists a subgroup containing the whole of that also sits inside and such that
- Since is a 2-group, both and are subnormal in . Thus, computing reduces to the subnormalizing group intersection problem.

### Taking the direct product

Simply take the union of all generating sets.