In mathematics, the Sims conjecture is a result in group theory, originally proposed by Charles Sims.[1] 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.[2]

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.[3][4][5]

References

  1. Sims, Charles C. (1967). "Graphs and finite permutation groups". Mathematische Zeitschrift. 95 (1): 76–86. doi:10.1007/BF01117534. S2CID 186227555.
  2. Pyber, László; Tracey, Gareth (2021). "Some simplifications in the proof of the Sims conjecture". arXiv:2102.06670 [math.GR].
  3. Cameron, Peter J.; Praeger, Cheryl E.; Saxl, Jan; Seitz, Gary M. (1983). "On the Sims conjecture and distance transitive graphs". Bulletin of the London Mathematical Society. 15 (5): 499–506. doi:10.1112/blms/15.5.499.
  4. Cameron, Peter J. (1982). "There are only finitely many distance-transitive graphs of given valency greater than two". Combinatorica. 2 (1): 9–13. doi:10.1007/BF02579277. S2CID 6483108.
  5. Isaacs, I. Martin (2011). Finite Group Theory. American Mathematical Society. ISBN 9780821843444. OCLC 935038216.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.