This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:BSGS
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:List_of_group_theory_topics
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:List_of_permutation_topics
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:Schreier–Sims_algorithm
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:Base_(group_theory)
dbo:wikiPageWikiLink
dbr:Strong_generating_set
Subject Item
dbr:SGS
dbo:wikiPageWikiLink
dbr:Strong_generating_set
dbo:wikiPageDisambiguates
dbr:Strong_generating_set
Subject Item
dbr:Strong_generating_set
rdf:type
yago:Abstraction100002137 yago:Group100031264 yago:WikicatPermutationGroups
rdfs:label
Strong generating set
rdfs:comment
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 . 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
dcterms:subject
dbc:Computational_group_theory dbc:Permutation_groups
dbo:wikiPageID
893727
dbo:wikiPageRevisionID
888201448
dbo:wikiPageWikiLink
dbr:Permutation_group dbr:Subgroup dbr:Generating_set_of_a_group dbr:Integers dbr:Stabilizer_chain dbr:Group_action_(mathematics) dbr:Group_theory dbr:Abstract_algebra dbc:Computational_group_theory dbr:Schreier–Sims_algorithm dbc:Permutation_groups dbr:Base_(group_theory) dbr:Set_(mathematics)
owl:sameAs
wikidata:Q7624555 freebase:m.03mh21 n10:4vbtx yago-res:Strong_generating_set
dbo:abstract
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 . 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.
prov:wasDerivedFrom
wikipedia-en:Strong_generating_set?oldid=888201448&ns=0
dbo:wikiPageLength
1734
foaf:isPrimaryTopicOf
wikipedia-en:Strong_generating_set
Subject Item
wikipedia-en:Strong_generating_set
foaf:primaryTopic
dbr:Strong_generating_set