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

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

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n9	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:P-group_generation_algorithm

rdfs:label

P-group generation algorithm

rdfs:comment

In mathematics, specifically group theory, finite groups of prime power order , for a fixed prime number and varying integer exponents , are briefly called finite p-groups. The p-group generation algorithm by M. F. Newmanand E. A. O'Brienis a recursive process for constructing the descendant treeof an assigned finite p-group which is taken as the root of the tree.

owl:sameAs

freebase:m.011jmym2

dbp:wikiPageUsesTemplate

dbt:Reflist dbt:EquationNote dbt:Hidden_begin dbt:Hidden_end

dct:subject

dbc:Group_theory dbc:P-groups

prov:wasDerivedFrom

n9:P-group_generation_algorithm?oldid=1068706794&ns=0

dbo:wikiPageID

43439826

dbo:wikiPageLength

24460

dbo:wikiPageRevisionID

1068706794

dbo:abstract

In mathematics, specifically group theory, finite groups of prime power order , for a fixed prime number and varying integer exponents , are briefly called finite p-groups. The p-group generation algorithm by M. F. Newmanand E. A. O'Brienis a recursive process for constructing the descendant treeof an assigned finite p-group which is taken as the root of the tree.

foaf:isPrimaryTopicOf

n9:P-group_generation_algorithm