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:
“The primary imperative for women who intend to assume a meaningful and decisive role in today’s social change is to begin to perceive themselves as having an identity and personal integrity that has as strong a claim for being preserved intact as that of any other individual or group.”
—Margaret Adams (b. 1916)
“Well, most men have bound their eyes with one or another handkerchief, and attached themselves to some of these communities of opinion. This conformity makes them not false in a few particulars, authors of a few lies, but false in all particulars. Their every truth is not quite true. Their two is not the real two, their four not the real four; so that every word they say chagrins us and we know not where to set them right.”
—Ralph Waldo Emerson (1803–1882)