×

On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes. (English) Zbl 1171.20002

Let \(\mathcal{PQ}\) denote the set of positive integers \(n\) such that \(n\) is a product of two distinct primes such that \(\gcd(n,\varphi(n))=1\); let \(\mathcal R\) be the set of all \(n\in\mathcal{PQ}\) such that any imprimitive permutation group of degree \(n\) is multiplicity-free.
The main result of the paper is Theorem 1.1 which says that \(\mathcal{PQ}\setminus\mathcal R=\{pq\mid q\equiv 2\pmod p\), where \(q\) is a Fermat prime and \(p\) is a prime}.
The result depends on the classification of permutation groups of prime degree (via the classification of finite simple groups).

MSC:

20B10 Characterization theorems for permutation groups
20D06 Simple groups: alternating groups and groups of Lie type
Full Text: DOI

References:

[1] Bannai, E.; Ito, T., Algebraic Combinatorics I: Association Schemes (1984), Benjamin/Cummings: Benjamin/Cummings Menlo Park, CA · Zbl 0555.05019
[2] Conway, J. H.; Curtis, R. T.; Norton, S. P.; Parker, R. A.; Wilson, R. A., Atlas of Finite Groups, Maximla Subgroups and Ordinary Characters for Simple Groups, with Computational Assistance from J.G. Thackray (1985), Oxford University Press: Oxford University Press Eynsham · Zbl 0568.20001
[3] Dixon, J. D.; Mortimer, B., Permutation groups, (Graduate Texts in Mathematics, vol. 163 (1996), Springer-Verlag: Springer-Verlag New York) · Zbl 0951.20001
[4] Feit, W., Some consequences of the classification of finite simple groups, (Cooperstein, B.; Mason, G., Santa Cruz Conference on Finite Groups. Santa Cruz Conference on Finite Groups, Proc. Symp. Pure Math., vol. 37 (1980), Amer. Math. Soc.: Amer. Math. Soc. Providence), 175-181 · Zbl 0522.20010
[5] Hanaki, A., Characters of association schemes containing a strongly normal closed subset of prime index, Proc. Amer. Math. Soc., 135, 9, 2683-2687 (2007) · Zbl 1118.05098
[6] A. Hanaki, M. Hirasaka, K. Uno, Commutativity of association schemes of prime square order having non-trivial thin closed subsets, J. Alg. Comb. (2007) (in press); A. Hanaki, M. Hirasaka, K. Uno, Commutativity of association schemes of prime square order having non-trivial thin closed subsets, J. Alg. Comb. (2007) (in press) · Zbl 1138.05074
[7] Hanaki, A.; Hirotsuka, K., Irreducible representations of wreath products of association schemes, J. Algebraic Combin., 18, 1, 47-52 (2003) · Zbl 1021.05098
[8] Hanaki, A.; Uno, K., Algebraic structure of association schemes of prime order, J. Algebraic Combin., 23, 2, 189-195 (2006) · Zbl 1089.05081
[9] Inglis, N. F.J.; Liebeck, M. W.; Saxl, J., Multiplicity-free permutation representations of finite linear groups, Math. Z., 192, 3, 329-337 (1986) · Zbl 0578.20006
[10] Ionin, Y. J., Generalized conference matrices and projective planes, European J. Combin., 28, 7, 1943-1954 (2007) · Zbl 1126.51002
[11] Ito, N., On permutation groups of prime degree \(p\) which contain at least two classes of conjugate subgroups of index \(p\). II, Nagoya Math. J., 37, 201-208 (1970) · Zbl 0194.03803
[12] Li, C. H.; Seress, A., The primitive permutation groups of squarefree degree, Bull. London Math. Soc., 35, 5, 635-644 (2003) · Zbl 1043.20001
[13] Marušič, D.; Scapellato, R., Classifying vertex-transitive graphs whose order is a product of two primes, Combinatorica, 14, 2, 187-201 (1994) · Zbl 0799.05027
[14] Praeger, C. E.; Xu, M. Y., Vertex-primitive graphs of order a product of two distinct primes, J. Combin. Theory Ser. B, 59, 2, 245-266 (1993) · Zbl 0793.05072
[15] Wielandt, H., Finite Permutation Groups (1964), New York Academic Press · Zbl 0138.02501
[16] Zieschang, P.-H., (An Algebraic Approach to Association Schemes. An Algebraic Approach to Association Schemes, Lecture Notes in Mathematics, vol. 1628 (1996), Springer) · Zbl 0857.05100
[17] Zieschang, P.-H., Theory of association schemes, (Springer Monograph in Mathematics (2005), Springer) · Zbl 0892.05052
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.