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:
“In private life he was good-natured, chearful, social; inelegant in his manners, loose in his morals. He had a coarse, strong wit, which he was too free of for a man in his station, as it is always inconsistent with dignity. He was very able as a minister, but without a certain elevation of mind necessary for great good, or great mischief.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“There is nothing less to our credit than our neglect of the foreigner and his children, unless it be the arrogance most of us betray when we set out to “americanize” him.”
—Charles Horton Cooley (1864–1929)