About: P-group generation algorithm

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
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. (en)
dbo:wikiPageID
  • 43439826 (xsd:integer)
dbo:wikiPageLength
  • 24460 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1068706794 (xsd:integer)
dbo:wikiPageWikiLink
dbp:title
  • Proof (en)
dbp:titlestyle
  • background:LightSteelBlue; text-align:center; (en)
dbp:wikiPageUsesTemplate
dcterms:subject
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. (en)
rdfs:label
  • P-group generation algorithm (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License