Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-12-03T19:10:59.974Z Has data issue: false hasContentIssue false

Improvement on the bounds of permutation groups with bounded movement

Published online by Cambridge University Press:  17 April 2009

Mehdi Alaeiyan
Affiliation:
Department of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16844, Iran e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let G be a permutation group on a set Ω with no fixed points in Ω and let m be a positive integer. Then we define the movement of G as, m := move(G) := supΓ{|Γg \ Γ| │ gG}. Let p be a prime, p ≥ 5. If G is not a 2-group and p is the least odd prime dividing |G|, then we show that n := |Ω| ≤ 4m – p + 3.

Moreover, if we suppose that the permutation group induced by G on each orbit is not a 2-group then we improve the last bound of n and for an infinite family of groups the bound is attained.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2003

References

[1]Cho, J.R., Kim, P.S., and Praeger, C.E., ‘The maxiamal number of orbits of a permutation groups with bounded movement’, J. Algebra 214 (1999), 625630.CrossRefGoogle Scholar
[2]Hassani, A., Khayaty, M., Khukhro, E.I. and Praeger, C.E., ‘Transitive permutation groups with bounded movement having maximal degree’, J. Algebra 214 (1999), 317337.CrossRefGoogle Scholar
[3]Neumann, P.M. and Praeger, C.E., ‘On the movement of a permutation group’, J. Algebra 214 (1999), 631635.Google Scholar
[4]Praeger, C.E., ‘On permutation groups with bounded movement’, J. Algebra 144 (1991), 436442.Google Scholar
[5]Rotman, J.J., An Introduction to the theory of groups, (3rd edition) (Allyn and Bacon, Boston, 1984).Google Scholar
[6]Tsuzuku, T., Finite groups and finite geometries (Cambridge University Press, Cambridge, 1982).Google Scholar