Misplaced Pages

Sims conjecture

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Conjecture in group theory

In mathematics, the Sims conjecture is a result in group theory, originally proposed by Charles Sims. He conjectured that if G {\displaystyle G} is a primitive permutation group on a finite set S {\displaystyle S} and G α {\displaystyle G_{\alpha }} denotes the stabilizer of the point α {\displaystyle \alpha } in S {\displaystyle S} , then there exists an integer-valued function f {\displaystyle f} such that f ( d ) | G α | {\displaystyle f(d)\geq |G_{\alpha }|} for d {\displaystyle d} the length of any orbit of G α {\displaystyle G_{\alpha }} in the set S { α } {\displaystyle S\setminus \{\alpha \}} .

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 f : N N {\displaystyle f:\mathbb {N} \to \mathbb {N} } such that whenever G {\displaystyle G} is a primitive permutation group and h > 1 {\displaystyle h>1} is the length of a non-trivial orbit of a point stabilizer H {\displaystyle H} in G {\displaystyle G} , then the order of H {\displaystyle H} is at most f ( h ) {\displaystyle f(h)} .

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.

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 .
  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.


Stub icon

This group theory-related article is a stub. You can help Misplaced Pages by expanding it.

Stub icon

This graph theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: