About: Base (group theory)     Goto   Sponge   NotDistinct   Permalink

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

Let be a finite permutation group acting on a set . A sequence of k distinct elements of is a base for G if the only element of which fixes every pointwise is the identity element of . Bases and strong generating sets are concepts of importance in computational group theory. A base and a strong generating set (together often called a BSGS) for a group can be obtained using the Schreier–Sims algorithm.

AttributesValues
rdfs:label
  • Base (group theory) (en)
rdfs:comment
  • Let be a finite permutation group acting on a set . A sequence of k distinct elements of is a base for G if the only element of which fixes every pointwise is the identity element of . Bases and strong generating sets are concepts of importance in computational group theory. A base and a strong generating set (together often called a BSGS) for a group can be obtained using the Schreier–Sims algorithm. (en)
sameAs
dbp:wikiPageUsesTemplate
Subject
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • Let be a finite permutation group acting on a set . A sequence of k distinct elements of is a base for G if the only element of which fixes every pointwise is the identity element of . Bases and strong generating sets are concepts of importance in computational group theory. A base and a strong generating set (together often called a BSGS) for a group can be obtained using the Schreier–Sims algorithm. It is often beneficial to deal with bases and strong generating sets as these may be easier to work with than the entire group. A group may have a small base compared to the set it acts on. In the "worst case", the symmetric groups and alternating groups have large bases (the symmetric group Sn has base size n − 1), and there are often specialized algorithms that deal with these cases. (en)
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage 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, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software