Permutation groups with bounded movement having maximum orbits. (Q692356): Difference between revisions

Let \(G\) be a finite permutation group on a set \(\Omega\) and suppose that all orbits of \(G\) have length \(>2\). Then the movement of \(G\) is the least integer \(m\) such that \(|\Gamma^g\setminus\Gamma|\leq m\) for all \(\Gamma\subseteq\Omega\) and all \(g\in G\). It is known that if \(G\) has movement \(m\) then \(G\) has at most \(2m-1\) orbits and the length of each orbit is bounded by a linear function of \(m\) [see \textit{L. Brailovsky, D. V. Pasechnik} and \textit{C. E. Praeger}, Proc. Am. Math. Soc. 123, No. 8, 2283-2295 (1995; Zbl 0843.20005)]. In the present paper the authors improve this result by showing that under these hypotheses \(G\) has at most \(\frac {1}{2}(3m-1)\) orbits. Furthermore, if \(G\) has exactly \(\frac{1}{2}(3m-1)\) orbits then: \(m\) is a power of \(3\); \(G\) is an elementary Abelian \(3\)-group of order \(3m\); all \(G\)-orbits have length \(3\); and the point stabilizers of the \(G\)-orbits are precisely the distinct subgroups of index \(3\) in \(G\).