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

In mathematics, the Sims conjecture is a result in group theory, originally proposed by Charles Sims. He conjectured that if is a primitive permutation group on a finite set and denotes the stabilizer of the point in , then there exists an integer-valued function such that for the length of any orbit of in the set . The conjecture was proven by Peter Cameron, Cheryl Praeger, Jan Saxl, and Gary Seitz using the classification of finite simple groups, in particular the fact that only finitely many isomorphism types of sporadic groups exist. The theorem reads precisely as follows.

Property Value
dbo:abstract
  • In mathematics, the Sims conjecture is a result in group theory, originally proposed by Charles Sims. He conjectured that if is a primitive permutation group on a finite set and denotes the stabilizer of the point in , then there exists an integer-valued function such that for the length of any orbit of in the set . The conjecture was proven by Peter Cameron, Cheryl Praeger, Jan Saxl, and Gary Seitz using the classification of finite simple groups, in particular the fact that only finitely many isomorphism types of sporadic groups exist. The theorem reads precisely as follows. Theorem — There exists a function such that whenever is a primitive permutation group and is the length of a non-trivial orbit of a point stabilizer in , then the order of is at most . Thus, in a primitive permutation group with "large" stabilizers, these stabilizers cannot have any small orbit. A consequence of their proof is that there exist only finitely many connected distance-transitive graphs having degree greater than 2. (en)
dbo:wikiPageID
  • 60436463 (xsd:integer)
dbo:wikiPageLength
  • 3300 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1095730196 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, the Sims conjecture is a result in group theory, originally proposed by Charles Sims. He conjectured that if is a primitive permutation group on a finite set and denotes the stabilizer of the point in , then there exists an integer-valued function such that for the length of any orbit of in the set . The conjecture was proven by Peter Cameron, Cheryl Praeger, Jan Saxl, and Gary Seitz using the classification of finite simple groups, in particular the fact that only finitely many isomorphism types of sporadic groups exist. The theorem reads precisely as follows. (en)
rdfs:label
  • Sims conjecture (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