Sims conjecture

Short description: Conjecture in group theory

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

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

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.