In abstract algebra, especially in the area of group theory, a strong generating set of a permutation group is a generating set that clearly exhibits the permutation structure as described by a stabilizer chain. A stabilizer chain is a sequence of subgroups, each containing the next and each stabilizing one more point.
Let be a group of permutations of the set Let
be a sequence of distinct integers, such that the pointwise stabilizer of is trivial (i.e., let be a base for ). Define
and define to be the pointwise stabilizer of . A strong generating set (SGS) for G relative to the base is a set
such that
for each such that .
The base and the SGS are said to be non-redundant if
for .
A base and strong generating set (BSGS) for a group can be computed using the Schreier–Sims algorithm.
Famous quotes containing the words strong and/or set:
“Wonder is the foundation of all philosophy; research, the progress; ignorance, the end. There is, by heavens, a strong and generous kind of ignorance that yields nothing, for honour and courage, to knowledge: an ignorance to conceive which needs no less knowledge than to conceive knowledge.”
—Michel de Montaigne (1533–1592)
“Then when he saw it could hold no more,
Bishop Hatto, he made fast the door;
And while for mercy on Christ they call,
He set fire to the barn and burnt them all.”
—Robert Southey (1774–1843)