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:
“You’ve always reminded me of a seagull, Jo. Strong and wild and fond of the wind and storms. And dreaming of flying far off to sea. And Mother always said that I was like a little cricket. Chirping contentedly on the hearth, never able to bear the thought of leaving home.”
—Victor Heerman (1893–1977)
“Not until the advent of Impressionism does the repudiation of principles set in which opened the way for the burlesque parade of the fashionable and publicity-crazed modernities of our century.”
—Johan Huizinga (1872–1945)