Permutation groups, partition lattices and block structures

Anagnostopoulou-Merkouri, Marina ; Bailey, R. A.  ; Cameron, Peter J. 

Forum of Mathematics, Sigma, Tome 13 (2025) no. 1, p. e180

Résumé

Let G be a finite transitive permutation group on $\Omega $. The G-invariant partitions form a sublattice of the lattice of all partitions of $\Omega $, having the further property that all its elements are uniform (that is, have all parts of the same size). If, in addition, all the equivalence relations defining the partitions commute, then the relations form an orthogonal block structure, a concept from statistics; in this case the lattice is modular. If it is distributive, then we have a poset block structure, whose automorphism group is a generalised wreath product. We examine permutation groups with these properties, which we call the OB property and PB property respectively, and in particular investigate when direct and wreath products of groups with these properties also have these properties.A famous theorem on permutation groups asserts that a transitive imprimitive group G is embeddable in the wreath product of two factors obtained from the group (the group induced on a block by its setwise stabiliser, and the group induced on the set of blocks by G). We extend this theorem to groups with the PB property, embedding them into generalised wreath products. We show that the map from posets to generalised wreath products preserves intersections and inclusions.We have included background and historical material on these concepts.

Détail

DOI : 10.1017/fms.2025.10126

Bibliographie

[1] Anagnostopoulou-Merkouri, M., Cameron, P. J. and Suleiman, E., ‘Pre-primitive permutation groups’, J. Algebra 636 (2023), 695–715.10.1016/j.jalgebra.2023.09.012 Google Scholar | DOI

[2] Bailey, R. A., ‘Distributive block structures and their automorphisms’, in Combin. Math. VIII (ed. Mcavaney, K. L.), Lecture Notes in Mathematics 884, Springer-Verlag, Berlin, 1981, 115–124. Google Scholar

[3] Bailey, R. A., ‘Strata for randomized experiments’, J. R. Stat. Soc. (B) 53 (1991), 27–78.10.1111/j.2517-6161.1991.tb01808.x Google Scholar | DOI

[4] Bailey, R. A., ‘Orthogonal partitions in designed experiments’, Des. Codes Cryptogr. 8 (1996), 45–77.10.1023/A:1018072606346 Google Scholar | DOI

[5] Bailey, R. A., Association Schemes: Designed Experiments, Algebra and Combinatorics, Cambridge Studies in Advanced Mathematics 84, Cambridge University Press, Cambridge, 2004.10.1017/CBO9780511610882 Google Scholar | DOI

[6] Bailey, R. A., ‘Latin squares at Rothamsted in the time of Fisher and Yates’, in Research in History and Philosophy of Mathematics, Joint Meeting of the British Society for the History of Mathematics and the Canadian Society for the History and Philosophy of Mathematics, Annals of the Canadian Society for History and Philosophy of Mathematics, 2021 Vol., eds. Zack, M. and Waszek, D. (Birkhäuser, Cham, 2023), 213–233. Google Scholar

[7] Bailey, R. A., Cameron, P. J., Praeger, C. E. and Schneider, C., ‘The geometry of diagonal groups’, Trans. Amer. Math. Soc. 375 (2022), 5259–5311.10.1090/tran/8507 Google Scholar | DOI

[8] Bailey, R. A. and Jungnickel, D., ‘Translation nets and fixed-point-free group automorphisms’, J. Combin. Theory Ser. A 55 (1990), 1–13.10.1016/0097-3165(90)90043-V Google Scholar | DOI

[9] Bailey, R. A., Praeger, C. E., Rowley, C. A. and Speed, T. P., ‘Generalized wreath products of permutation groups’, Proc. Lond. Math. Soc. 47 (1983), 69–82.10.1112/plms/s3-47.1.69 Google Scholar | DOI

[10] Bamberg, J., Hanaki, A. and Lansdown, J., ‘AssociationSchemes, A GAP package for working with association schemes and homogeneous coherent configurations’, Version 3.1.0 (2024) (GAP package). Available at http://www.jesselansdown.com/AssociationSchemes. Google Scholar

[11] Cameron, P. J., Parallelisms of Complete Designs, Cambridge University Press, Cambridge, 1976.10.1017/CBO9780511662102 Google Scholar | DOI

[12] Cameron, P. J., Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, Cambridge, 1994. Google Scholar

[13] Cameron, P. J., ‘Coherent configurations, association schemes, and permutation groups’, in Groups, Combinatorics and Geometry (ed. Ivanov, A. A., Liebeck, M. W. and Saxl, J.), World Sci., Singapore, 2003, 55–71.10.1142/9789812564481_0004 Google Scholar | DOI

[14] Cameron, P. J., ‘Asymmetric Latin squares, Steiner triple systems, and edge parallelisms’. Available at . Google Scholar | arXiv

[15] Chataut, L. M. and Dixon, M. R., ‘Groups with the weak minimal condition on non-permutable subgroups’, in Infinite Group Theory: From the Past to the Future (ed. Baginski, P., Fine, B. and Gaglioni, A. M.), World Scientific, Hackensack, NJ, USA, 2018, 1–18. Google Scholar

[16] Davey, B. A. and Priestley, H. A., Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990. Google Scholar

[17] Dixon, J. D. and Mortimer, B., Permutation Groups, Graduate Texts in Mathematics 163, Springer, 1996.10.1007/978-1-4612-0731-3 Google Scholar | DOI

[18] Dubreil, P. and Dubreil-Jacotin, M.-L., ‘Théorie algébrique des relations d’équivalence’, J. Math. Pures Appl. (Liouville) 18 (1939), 63–95. Google Scholar

[19] Finberg, D., Mainetti, M. and Rota, G.-C., ‘The logic of commuting equivalence relations’, in Logic Algebra (Pontignano, 1994), Lecture Notes Pure Appl. Math. 180, Dekker, New York, 1996, 69–96. Google Scholar

[20] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.13.1; 2024. Available at https://www.gap-system.org. Google Scholar

[21] Hanaki, A. and Miyamoto, I., ‘Classification of association schemes with small vertices’. Available at http://math.shinshu-u.ac.jp/~hanaki/as/. Google Scholar

[22] Holland, W. C., ‘The characterization of generalized wreath products’, J. Algebra 13 (1969), 152–172.10.1016/0021-8693(69)90069-6 Google Scholar | DOI

[23] Houtman, A. M. and Speed, T. P., ‘Balance in designed experiments with orthogonal block structure’, Ann. Statist. 4 (1983), 1069–1085. Google Scholar

[24] Humphreys, J. M., Linear Algebraic Groups, Graduate Texts in Mathematics 21, Springer-Verlag, Berlin–Heidelberg–New York, 1975.10.1007/978-1-4684-9443-3 Google Scholar | DOI

[25] Iwasawa, K., ‘Über die endlichen Gruppen und die Verbände ihrer Untergruppen’, J. Fac. Sci. Imp. Univ. Tokyo Sect. I 4 (1941), 171–199. Google Scholar

[26] Kempthorne, O., Zyskind, G., Addelman, S., Throckmorton, T. N. and White, R. F., Analysis of Variance Procedures , Aeronautical Research Laboratory, Ohio, Rep. 149 (1961). Google Scholar

[27] Krasner, M. and Kaloujnine, L., ‘Produit complet des groupes de permutations et problème d’extension de groupes’, Acta Sci. Math. (Szeged) 13 (1950), 208–230; (1951), 39–66, 69–82. Google Scholar

[28] Mckay, B. D. and Wanless, I. M., ‘On the number of Latin squares’, Ann. Comb. 9 (2005), 335–344.10.1007/s00026-005-0261-7 Google Scholar | DOI

[29] Nelder, J. A., ‘The analysis of randomized experiments with orthogonal block structure. I. Block structure and the null analysis of variance’, Proc. R. Soc. Lond. Ser. A 283 (1965), 147–162. Google Scholar

[30] Nelder, J. A., ‘The analysis of randomized experiments with orthogonal block structure. II. Treatment structure and the general analysis of variance’, Proc. R. Soc. Lond. Ser. A 283 (1965), 163–178. Google Scholar

[31] Schmidt, R., Subgroup Lattices of Groups, Expositions in Mathematics 14, Walter de Gruyter, 1994.10.1515/9783110868647 Google Scholar | DOI

[32] Scott, L. L., ‘Representations in characteristic ’, Proc. Symp. Pure Math. 37 (1980), 319–331.10.1090/pspum/037/604599 Google Scholar | DOI

[33] Silcock, H. K., ‘Generalized wreath products and the lattice of normal subgroups of a group’, Algebra Universalis 7 (1977), 361–372.10.1007/BF02485445 Google Scholar | DOI

[34] Speed, T. P. and Bailey, R. A., ‘On a class of association schemes derived from lattices of equivalence relations’, in Algebraic Structures and Applications (eds. Schultz, P., Praeger, C. E. and Sullivan, R. P.), Marcel Dekker, New York, 1982, 55–74. Google Scholar

[35] Speed, T. P. and Bailey, R. A., ‘Factorial dispersion models’, Int. Stat. Rev. 55 (1987), 261–277.10.2307/1403405 Google Scholar | DOI

[36] Throckmorton, T. N., Structures of Classification Data, Ph.D. thesis, Iowa State University, 1961.10.31274/rtd-180817-2592 Google Scholar | DOI

[37] Wells, C., ‘Some applications of the wreath product construction’, Amer. Math. Mon. 83 (1976), 317–338.10.1080/00029890.1976.11994114 Google Scholar | DOI

[38] Yan, C. H., ‘Distributive laws for commuting equivalence relations’, Discrete Math. 181 (1998), 295–298. Google Scholar

[39] Yates, F., ‘Complex experiments’, Suppl. J. R. Stat. Soc. II (1935), 181–247.10.2307/2983638 Google Scholar | DOI

[40] Zyskind, G., Error Structures in Experimental Designs, Ph.D. thesis, Iowa State University, 1958.10.31274/rtd-180814-1965 Google Scholar | DOI

[41] Zyskind, G., ‘On structure, relation, , and expectation of mean squares’, Sankhyā A 24 (1962), 115–148. Google Scholar