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:
“‘He hardly drinks a pint of wine,
And that, I doubt, is no good sign.
His stomach too begins to fail:
Last year we thought him strong and hale,
But now, he’s quite another thing;
I wish he may hold out till spring.’
Then hug themselves, and reason thus;
‘It is not yet so bad with us.’”
—Jonathan Swift (1667–1745)
“This ferry was as busy as a beaver dam, and all the world seemed anxious to get across the Merrimack River at this particular point, waiting to get set over,—children with their two cents done up in paper, jail-birds broke lose and constable with warrant, travelers from distant lands to distant lands, men and women to whom the Merrimack River was a bar.”
—Henry David Thoreau (1817–1862)