Abstract.
For a finite permutation group G acting on a set Ω, we say that G is k-free if the set-wise stabilizer of every k-subset of Ω is trivial. The purpose of this article is to describe, for all k, the primitive k-free permutation groups.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 20 February 2006
Rights and permissions
About this article
Cite this article
Bates, C., Bundy, D., Hart, S. et al. Primitive k-free permutation groups. Arch. Math. 88, 193–198 (2007). https://doi.org/10.1007/s00013-006-1913-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-006-1913-5