About: Computational group theory     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In mathematics, computational group theory is the study ofgroups by means of computers. It is concernedwith designing and analysing algorithms anddata structures to compute information about groups. The subjecthas attracted interest because for many interesting groups(including most of the sporadic groups) it is impracticalto perform calculations by hand. Important algorithms in computational group theory include: Some achievements of the field include: * complete enumeration of all finite groups of order less than 2000 * computation of representations for all the sporadic groups

AttributesValues
rdfs:label
  • Computational group theory (en)
rdfs:comment
  • In mathematics, computational group theory is the study ofgroups by means of computers. It is concernedwith designing and analysing algorithms anddata structures to compute information about groups. The subjecthas attracted interest because for many interesting groups(including most of the sporadic groups) it is impracticalto perform calculations by hand. Important algorithms in computational group theory include: Some achievements of the field include: * complete enumeration of all finite groups of order less than 2000 * computation of representations for all the sporadic groups (en)
sameAs
dbp:wikiPageUsesTemplate
Subject
Link from a Wikipage to an external page
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • In mathematics, computational group theory is the study ofgroups by means of computers. It is concernedwith designing and analysing algorithms anddata structures to compute information about groups. The subjecthas attracted interest because for many interesting groups(including most of the sporadic groups) it is impracticalto perform calculations by hand. Important algorithms in computational group theory include: * the Schreier–Sims algorithm for finding the order of a permutation group * the Todd–Coxeter algorithm and Knuth–Bendix algorithm for coset enumeration * the for finding random elements of a group Two important computer algebra systems (CAS) used for group theory areGAP and Magma. Historically, other systems such as CAS (for character theory) and Cayley (a predecessor of Magma) were important. Some achievements of the field include: * complete enumeration of all finite groups of order less than 2000 * computation of representations for all the sporadic groups (en)
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


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 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 927 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software