An Entity of Type : yago:Group100031264, within Data Space : dbpedia.org associated with source document(s)

In mathematics, specifically group theory,a descendant tree is a hierarchical structurefor visualizing parent-descendant relationsbetween isomorphism classes of finite groups of prime power order ,for a fixed prime number and varying integer exponents .Such groups are briefly called finite p-groups.The vertices of a descendant tree are isomorphism classes of finite p-groups.

AttributesValues
rdf:type
rdfs:label
• Descendant tree (group theory)
rdfs:comment
• In mathematics, specifically group theory,a descendant tree is a hierarchical structurefor visualizing parent-descendant relationsbetween isomorphism classes of finite groups of prime power order ,for a fixed prime number and varying integer exponents .Such groups are briefly called finite p-groups.The vertices of a descendant tree are isomorphism classes of finite p-groups.
foaf:depiction
foaf:isPrimaryTopicOf
thumbnail
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
title
• Proof
titlestyle
• background:LightSteelBlue; text-align:center;
has abstract
• In mathematics, specifically group theory,a descendant tree is a hierarchical structurefor visualizing parent-descendant relationsbetween isomorphism classes of finite groups of prime power order ,for a fixed prime number and varying integer exponents .Such groups are briefly called finite p-groups.The vertices of a descendant tree are isomorphism classes of finite p-groups. Additionally to their order , finite p-groups have two further related invariants,the nilpotency class and the coclass .It turned out that descendant trees of a particular kind,the so-called pruned coclass trees whose infinitely many vertices share a common coclass ,reveal a repeating finite pattern.These two crucial properties of finiteness and periodicityadmit a characterization of all members of the treeby finitely many parametrized presentations.Consequently, descendant trees play a fundamental rolein the classification of finite p-groups.By means of kernels and targets of Artin transfer homomorphisms,descendant trees can be endowed with additional structure. An important question is how the descendant tree can actually be constructedfor an assigned starting group which is taken as the root of the tree.The p-group generation algorithm is a recursive processfor constructing the descendant tree of a given finite p-group playing the role of the tree root.This algorithm is implemented in the computational algebra systems GAP and Magma.
prov:wasDerivedFrom
page length (characters) of wiki page
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git51 as of Sep 16 2020

Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About

OpenLink Virtuoso version 08.03.3319 as of Dec 29 2020, on Linux (x86_64-centos_6-linux-glibc2.12), Single-Server Edition (61 GB total memory)