About: Descendant tree (group theory)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Group100031264, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDescendant_tree_%28group_theory%29

In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between 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) (en)
rdfs:comment
  • In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between 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. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Terminology_of_trees.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/TreeOf2Groups.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/TreeOf2Groups222.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/TreeOf3Groups.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/TreeOf3Groups39.png
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
thumbnail
title
  • Proof (en)
titlestyle
  • background:LightSteelBlue; text-align:center; (en)
has abstract
  • In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between 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 periodicity admit a characterization of all members of the tree by finitely many parametrized presentations. Consequently, descendant trees play a fundamental role in 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 constructed for an assigned starting group which is taken as the root of the tree. The p-group generation algorithm is a recursive process for 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. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software