Skip to main content
Log in

Galois correspondence between permutation groups and cellular rings (association schemes)

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The paper contains a survey on some areas of research in algebraic combinatorics done originally in Russian. The main problem under consideration is description of the combinatorial configurations which admit a given automorphism group. A special attention is paid to applications of the Galois correspondence between permutation groups and association schemes (cellular rings in our terminology).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adam, A.: Problem 2–10. J. Comb. Theory (A)2, 393 (1967)

    Google Scholar 

  2. Adam, A.: On some open problems of applied automation theory (suggested by the mathematical modelling of certain neuronal networks). Acta Cybern3, 187–214 (1977)

    Google Scholar 

  3. Adel'son-Velskii, G.M., Weisfeiler, B. Ju., Leman, A.A., Faradžev I.A.: Example of a graph without a transitive automorphism group. Sov. Math. Dokl.10, 440–441 (1969)

    Google Scholar 

  4. Aigner, M.: Combinatorial Theory. Springer, Berlin, Heidelberg, New York 1979

    Google Scholar 

  5. Algorithmic Investigations in Combinatorics. Nauka, Moscow 1978 (in Russian)

  6. Bannai, E., Ito, T.: Algebraic Combinatorics 1. Association Schemes. Benjamin/Cummings, Menlo Park, California 1984

    Google Scholar 

  7. Bannai, E., Ito, T.: Current researches on algebraic combinatorics. Graphs and Combinatorics2, 287–308 (1986)

    Google Scholar 

  8. Biggs, N.L.: Automorphic graphs and the Krein condition. Geom. Dedicata5, 117–127 (1976)

    Google Scholar 

  9. Bodnarchuk, V.G., Kaluznin, L.A., Kotov V.N., Romov B.A.: Galois theory for Post algebras I, II. Kibernetika N3, 1–10 (1969), N5, 1–9 (1969) (in Russian)

    Google Scholar 

  10. Brouwer, A.E., Cohen, A.M., Computation of some parameters of Lie geometries. In: Algorithms in Combinatorial Design Theory. Ann. Discrete Math.26, 1–48 1985

    Google Scholar 

  11. Brouwer, A.E., Lint, J.H. van: Strongly regular graphs and partial geometries. In: Enumeration and Design. Proc. Silver Jubilee Conf. on Combinatorics, Waterloo, pp. 85–122, Toronto: Academic Press 1984

    Google Scholar 

  12. Buekenhout, F., Rowlinson P.: The uniqueness of certain automorphic graphs. Geom. Dedicata11, 443–446 (1981)

    Google Scholar 

  13. Burnside, W.: Theory of Groups of Finite Order. Cambridge: Cambridge University Press 1911

    Google Scholar 

  14. Campbell, C.M., Robertson, E.F.: Presentation for the simple groupsG, 105 < |G| < 106. Commun. Algebra12, 2643–2663 (1984)

    Google Scholar 

  15. Chao, Chong Yun, Wells, Jackueline C.: A class of vertex-transitive digraphs. J. Comb. Theory (B)14, 246–255 (1973)

    Google Scholar 

  16. Chuvaeva, I.V.: On some combinatorial objects invariant under the Mathieu groupM 12. In: Methods for Complex System Studies, pp. 47–52. Moscow: Institute for System Studies 1983 (in Russian)

    Google Scholar 

  17. Cohen, A.M.: Geometries originating from certain distance regular graphs. London Math. Soc. Lect. Note Ser.49, 81–87 (1981)

    Google Scholar 

  18. Davydov, E.G.: On finite graphs and their automorphisms. In: Problemi Kibernetiki, vip. 17, pp. 27–39. Moscow: Nauka 1966 (in Russian)

    Google Scholar 

  19. Davydov, E.G.: On automorphisms of unions of direct products of graphs. Kibernetika6 (1968) (in Russian)

  20. Davydov, E.G: On the symmetry of graphs. In: Voprosy kibernetiki. Proceeding of Seminar on discrete mathematics, pp. 26–49. Moscow: Sovetskoe Radio 1973 (in Russian)

    Google Scholar 

  21. Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl., No10 (1973)

  22. Diawara, O.: Sur le Group Simple de J. McLaughlin. Ph.D. Thesis, University of Bruxelles 1984

  23. Djokovic, D.Z.: Isomorphism problem for special class of graphs. Acta Math. Acad. Sci. Hung.21, 267–270 (1970)

    Google Scholar 

  24. Egorov, V.N., Markov, A.I.: On Adam's conjecture for graphs with circulant adjacency matrices. Dok. Akad. Nauk SSSR249, 529–532 (1979) (in Russian)

    Google Scholar 

  25. Faradžev, I.A.: The constructive enumeration of combinatorial objects. In: Algorithmic Investigations in Combinatorics, pp. 3–11. Moscow: Nauka 1978 (in Russian)

    Google Scholar 

  26. Faradžev, I.A.: A complex of programs for computation inV-rings of permutation groups. In: Methods and programs for solution of optimization problems on graphs and networks. Part I, pp. 218–222. Novosibirsk, 1982 (in Russian)

  27. Faradžev, I.A: On cellular subrings of symmetric cartesian square of cellular rings of rank 3. In: Vesnik Kievskogo Universiteta pp. 113–114. Kiev 1985 (in Ukrainian)

  28. Faradžev, I.A.: Cellular subrings of symmetric square of cellular ring of rank 3. In: Investigations in the Algebraic Theory of Combinatorial Objects, pp. 76–95. Moscow: Institute for System Studies 1985 (in Russian)

    Google Scholar 

  29. Fischer, J., McKay, J.: The nonabelian simple groupsG, |G| < 106 — maximal subgroups. Math. Comput.32, 1293–1302 (1978)

    Google Scholar 

  30. Gol'fand, Ja. Ju.: Description of subrings inV(S p1 × Sp2 ×... × SPm).. In: Investigation in the algebraic theory of combinatorial objects, pp. 65–75. Moscow: Institute for System Studies 1985 (in Russian)

    Google Scholar 

  31. Gol'fand, Ja. Ju., Klin, M.H.: Amorphic cellular rings. I. Ibid, pp. 32–38 (in Russian)

  32. Gol'fand, Ja. Ju., Klin, M.H., Naimark, N.L.: The structure ofS-rings overZ 2m. In XVI All Union Algebraic Conference, pp. 195–196. Leningrad 1981 (in Russian)

  33. Gol'fand, Ja. Ju., Naimark, N.L., Pöschel R.: The structure ofS-rings overZ 2 m. Preprint. Akademie der Wissenschaften der DDR. Institute für Mathematik, Berlin, 1983

    Google Scholar 

  34. Gordon, L.M., Levingstone, R.: The construction of some automorphic graphs. Geom. Dedicata10, 261–267 (1981)

    Google Scholar 

  35. Gorenstein, D.: Finite Simple Groups. An Introduction to their Classification. New York, London: Plenum Press 1982

    Google Scholar 

  36. Hall, M.: A search for simple groups of order less than one million. In: Computational Problems in Abstract Algebra, pp. 137–168. London: Pergamon Press 1970

    Google Scholar 

  37. Harary, F.: Combinatorial problems of graphs enumeration. In: Applied Combinatorial Mathematics. New York, London, Sydney: John Wiley and Sons, Inc. 1964

    Google Scholar 

  38. Harary, F., Palmer, E.M.: Graphical Enumeration. New York, London: Academic Press 1973

    Google Scholar 

  39. Hubaut, X.L.: Strongly regular graphs. Discrete Math.13, 357–381 (1975)

    Google Scholar 

  40. Hayden, J.L., Association algebras for finite projective planes. J. Comb. Theory (A)34, 360–374 (1983)

    Google Scholar 

  41. Investigations in the Algebraic Theory of Combinatorial Objects. Collection of Papers. Moscow: Institute for System Studies 1985 (in Russian)

  42. Ivanov, A.A. Construction with aid of computer of some new automorphic graphs. In: Aerofizika i prikladnaya matematika, pp. 144–146. Moscow 1981 (in Russian)

  43. Ivanov, A.A. Combinatorial-algebraic methods in investigation of distance-regular graphs. Ph.D. Thesis. Moscow 1984 (in Russian)

  44. Ivanov, A.A., Klin M.H., Faradžev I.A. Primitive representations of the nonabelian simple groups of order less than 106. Preprint. Moscow: Institute for System Studies. Part I (1982), Part II (1984) (in Russian)

    Google Scholar 

  45. Ivanov, A.A., Chuvaeva, I.V.: Action of the groupM 12 on Hadamard matrices. In: Investigations in the Algebraic Theory of Combinatorial objects, pp. 159–169. Moscow: Institute for System Studies 1985 (in Russian)

    Google Scholar 

  46. Ivanov A.V.: Amorphic cellular rings II. Ibid, pp. 39–48 (in Russian)

  47. Ivanov, A.V., Faradžev, I.A.: Ranks and the subdegrees of the symmetric groups acting on partitions. Ibid, pp. 159–169 (in Russian)

  48. Jones, G.A., Soomro, K.D.: The maximality of certain wreath products in alternating and symmetric groups, Quart. J. Math. Oxford,37, 419–435 (1986)

    Google Scholar 

  49. Kageyaman, S., Saha, G.M., Das, A.D.: Reduction of the number of association classes of hypercubic association schemes. Inst. Stat. Math.30, 115–123 (1978)

    Google Scholar 

  50. Kaluznin, L.A., Klin, M.H.: On some maximal subgroups of symmetric and alternating groups. Mat. Sb. Nov. Ser.87, 91–121 (1972) (in Russian)

    Google Scholar 

  51. Kaluznin, L.A., Klin, M.H.: On some numerical invariants of permutation groups. Latviiskii Mat. Ezheg.18, 81–99 (1976) (in Russian)

    Google Scholar 

  52. Kaluznin, L.A., Klin, M.H., Sushchanskii, V.I.: Operation of exponentiation of permutation groups. I. Izvestiia Wuzov. Ser. Mat.8, 26–33 (1979) (in Russian)

    Google Scholar 

  53. Kaluznin, L.A., Sushchanskii, V.I., Ustimenko, V.A.: Use of computer in the theory of permutation groups and their applications. Kibernetika6, 83–94 (1982) (in Russian)

    Google Scholar 

  54. Klin, M.H.: On the number of graphs for which a given permutation group is an automorphism group. Kibernetika6, 131–137 (1970) (in Russian)

    Google Scholar 

  55. Klin, M.H.:V-rings and their connection with automorphism groups of binary relations. Mat. Issled. (Kishinev) VII, N 1 (23), 204–205 (1972) (in Russian)

    Google Scholar 

  56. Klin, M.H.: On a method for construction primitive graphs. Trudi Niklolaevskogo Korablestroitel'nogo Instituta87, 3–8 (1974) (in Russian)

    Google Scholar 

  57. Klin, M.H.: Investigation of algebras of invariant relations of some classes of permutation groups. Ph.D. Thesis. Nikolaev 1974 (in Russian)

  58. Klin, M.H.: Consideration on computer MIR-1 the expectional cases in the problem about maximality of the induced symmetric groups. In: Computations in Algebra and Combinatrics, pp. 54–72. Kiev 1978 (in Russian)

  59. Klin, M.H.: Computations inV-rings of permutation groups and their applications in the graph theory and combinatiorics. In: All Union Symposium. Artificial Intelegence and Automatization of Investigations in Mathematics, pp. 34–36. Kiev (1978) (in Russian)

  60. Klin, M.H.: On the edge but not vertex transitive graphs. In: Algebraic Methods in Graph Theory, pp. 399–403. Budapest, Amsterdam: North Holland 1981

    Google Scholar 

  61. Klin, M.H.: On axiomatics of cellular rings. In: Investigations in the Algebraic Theory of Cominbatorial Objects, pp. 6–32. Moscow: Institute for Systems Studies 1985 (in Russian)

    Google Scholar 

  62. Klin, M.H.: Faradžev I.A.: The method ofV-rings in the theory of permutation groups and its applications in combinatorics. In: Investigations on Applied Graph Theory, pp. 59–97. Novosibirsk: Nauka, 1986 (in Russian)

    Google Scholar 

  63. Klin, M.Ch., Naimark, N.L., Pöschel, R.: Schur rings overZ 2m. Preprint. Acad. Wiss. DDR, N 14: Berlin 1981

  64. Klin, M.H.: Pöschel, R.: The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings. Preprint AdWd DDR ZIMN. Berlin: März 1978

    Google Scholar 

  65. Klin, M.H.: Pöschel R. The König problem, the isomorphism problem for cyclic graphs and the method of Schur rings. In: Algebraic Methods in Graph Theory, pp. 405–434. Budapest, Amsterdam: North Holland 1981

    Google Scholar 

  66. Klin, M.Ch., Pöschel, R.: The isomorphism problem for circulant graphs withp n vertices. Preprint. Zentralinst. für Math. und Mech, Berlin 1980

    Google Scholar 

  67. Krasner, M.: Une génèralisation de la notion de corps. J. Math. Pures Appl.19, 367–383 (1938)

    Google Scholar 

  68. Leman, A.A.: On automorphism of some classes of graphs. Avtom. Telemekh2, 75–82 (1970) (in Russian)

    Google Scholar 

  69. Makarov, A.V.: On automatization of solution of problems on graphs with symmetry. In: Wuchislitel'nye Sistemy vip. 92, pp. 56–61. Novosibirsk 1982 (in Russian)

  70. Mathon, R., Rosa, A.: A new strongly regular graph. J. Comb. Theory (A) 38, 84–86 (1985)

    Google Scholar 

  71. McKay, J.: The simple groupsG, |G| < 106 — character tables. Commun. Algebra 7, No 13, 1293–1302 (1979)

    Google Scholar 

  72. Moon, A.: On the uniqueness of the graphsG(n, k) of the Johnson schemes. J. Comb.Theory (B) 33, 256–264 (1982)

    Google Scholar 

  73. Muzichuk, M.E.: Description ofS-rings over the groupA 4. In: Permutation Groups and Combinatorial Objects. Preprint 82. 14, pp. 3–17. Kiev 1982 (in Russian)

  74. Muzichuk, M.E.: Structure of the primitiveS-rings over the groupA 5. In: VIII All Union Simposium on Group Theory, pp. 83–84. Kiev 1982 (in Russian)

  75. Muzichuk, M.E.: The simplicity of theV-ring of the projective linear groupPGL n (Fq) acting on the Grassman manifoldD mn . In: XVIII All Union Algebraic Conference. Part II, 47. Kischinev 1985 (in Russian)

  76. Muzichuk, M.E.: The subschemes of the Hamming schemes. In: Investigation in the Algebraic Theory of Combinatorial Objects, pp. 49–65. Moscow: Institute for System Studies 1985 (in Russian)

    Google Scholar 

  77. On Construction and Identification of Graphs. Ed. Weisfeiler B. Lect. Notes Math.558 (1976)

  78. Palfy, P.P.: Isomorphism problem for relational strcutures with a cyclic automorphism. Europ. J. Comb.8, 35–43 (1987)

    Google Scholar 

  79. Pogorelov, B.A.: Primitive permutation groups of small degree I, II. Algebrai Logika 19 N 3, 348–379 (1980), 19 N 4, 423–457 (1980) (in Russian)

    Google Scholar 

  80. Pöschel, R.: Untersuchungen vonS-Ringer insbesondere im Gruppenring von p-Gruppen. Math. Nachr.60, 1–27 (1974)

    Google Scholar 

  81. Pöschel, R., Kaluznin L.A.: Funktionen und Relationenalgebren. Berlin: Deutscher Verlag der Wissenschaften 1979

    Google Scholar 

  82. Romov, B.A.: On formularity of predicates on finite sets. Kibernetika1, 41–42 (1971) (in Russian)

    Google Scholar 

  83. Salomaa, A.: Some completeness criteria for sets of functions over a finite domain I. II. Ann. Univ. Turku. Ser. AI53, 1–9 (1962),63, 1–19 (1963)

    Google Scholar 

  84. Schur, I.: Zur Theorie der einfach transitiven Permutationsgruppen. S.B. Preuss. Akad. Wiss., Phys.-Math., pp. 598–623, 1933

  85. Sheehan, J.: The number of graphs with a given automorphism group. Can. J. Math.20, 1068–1076 (1968)

    Google Scholar 

  86. Sims, C.C.: Computing methods in the study of permutation groups. In: Computing Problems in Abstract Algebra, pp. 169–184. Pergamon Press 1970

  87. Turner, J.: Point-symmetric graphs with a prime number of points. J. Comb. Theory3, 136–145 (1967)

    Google Scholar 

  88. Ustimenko, V.A.: Intersection indexes of the Hecke algebrasH(PGL n(q), BWjB). In: Investigations on Algebraic Theory of Combinatorial Objects, pp. 95–104. Moscow: Institute for System Studies 1985 (in Russian)

    Google Scholar 

  89. Ustimenko-Bakumovski, V.A., (= Ustimenko, V.A.): An algorithm for construction of blockdesigns and strongly-regular graphs with a given automorphism groups. In: Computations in Algebra and Combinatorics, pp. 137–148. Kiev, 1978 (in Russian)

  90. Ustimenko-Bakumovski, V.A.: Strongly regular graphs invariant under the groups\(\left[ {\mathfrak{S}_n } \right]^{\mathfrak{S}m} \) forn ≥ 3. In: Computation in Algebra and Combinatorics, pp. 101–113. Kiev: 1978 (in Russian)

  91. Ustimenko-Bakumovski, V.A.: On automorphism groups of strongly regular graphs, invariant under exponentiation of symmetric groups. In: Computation in Algebra, Number Theory and Combinatorics, pp. 59–72. Kiev 1980 (in Russian)

  92. Ustimenko-Bakumovski, V.A.: On primitive permutation groups containing the exponentiationS 2 ↑ S2k. In: XVI All Union Algebraic Conference. Part I, pp. 197–198. Leningrad 1981 (in Russian)

  93. Ustimenko-Bakumovski, V.A.: On Schur'sV-rings of finite Chevalle group and its Weil group acting on flags. In: VIII All Union Symposium on Group Theory, p. 130. Kiev 1982 (in Russian)

  94. Weisfeiler B.Ju., Leman A.A. The reduction of a graph to its canonical form and the arising algebra. NTI, ser. 2.9, 12–16 (1968) (in Russian)

    Google Scholar 

  95. Wielandt, H.: Finite Permutation Groups. New Yorks: Academic Press 1964

    Google Scholar 

  96. Wielandt, H.: Permutation groups through invariant relations and invariant functions. Lect. Notes Dept. Math. Ohio State Univ.: Columbia 1969

    Google Scholar 

  97. Zaichenko, V.A.: Algorithms for computations inV-rings of permutation groups. Preprint 1981 (in Russian)

  98. Zaichenko, V.A.: Constructive enumeration of 2-graphs of order 10. Preprint 1981 (in Russian)

  99. Zaichenko, V.A.: An algorithmic approach to the synthesis of combinatorial objects and computation in permutation groups on the base of invariant relations method. Ph.D. Thesis. Moscow 1981 (in Russian)

  100. Zaichenko, V.A., Ivanov, A.A., Klin, M.H.: Construction and investigation of some new automorphic graphs. In: Methods and Programs for solution of optimization problems on graphs and networks. Part 2, pp. 48–50. Novosibirsk 1982 (in Russian)

  101. Zaichenko, V.A., Klin, M.H.: Construction and investigation with aid of a computer of some block designs and strongly regular graphs invariant under the exponentiation of the symmetric groups. In: Permutation groups and combinatorial objects. Preprint 82. 14, pp. 18–37. Kiev 1982 (in Russian)

  102. Zaichenko, V.A., Klin, M.H., Faradžev, I.A.: On some problem, related to the representation of permutation groups in the computer memory. In: Computations in Algebra, Number Theory and Combinatorics, pp. 21–32. Kiev 1980 (in Russian)

  103. Zhdan-Pushkin, V.V., Ustimenko-Bakumovski, V.A.: Schur'sV-rings of finite unitary groups acting on maximal isotropic subspaces. In: VIII All Union Symposium on Group Theory, p. 36. Kiev 1982 (in Russian)

  104. Cameron, P.J., Goethals, J.M., Seidel, J.J.: Strongly regular graphs having strongly regular subconstituents. J. Algebra55, 257–280 (1978)

    Google Scholar 

  105. Faradžev, I.A., Klin, M.H., Muzichuk, M.E.: Cellular rings and automorphism groups of graphs. In: Investigations in Algebraic Theory of Combintorial Objects (to be published by Kluwer Publ. Co.)

  106. Ivanov, A.A., Muzichuk, M.E., Ustimenko, V.A.: On a new family of (P andQ)-polynomial schemes. Europ. J. Comb.10, 337–345 (1989)

    Google Scholar 

  107. Ivanov, A.V., Klin, M.H.: An example of strongly regular graph satisfying the 4-vertex condition which is not a rank 3 graph. In “Proceedings of the XIX All Union Algebraic Conference, Part 2”, p. 104, L'vov, 1987 (in Russian)

  108. Ivanov, A.V.: Non rank 3 strongly regular graph with the 5-vertex condition. Combinatorica,9, 255–260 (1989)

    Google Scholar 

  109. Klin, M.Ch. (= Klin, M.H.), Pöschel, R., Rosenbaum, K.: Angewandte Algebra. Einführung in gruppentheoretisch-kombinatorische Methoden. Berlin: VEB Deustcher Verlag der Wissenschaften 1988

    Google Scholar 

  110. Muzichuk, M.E.:V-rings of permutation groups with invariant metric. Ph.D. Thesis. Kiev, Kiev State University, 1987 (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faradžev, I.A., Ivanov, A.A. & Klin, M.H. Galois correspondence between permutation groups and cellular rings (association schemes). Graphs and Combinatorics 6, 303–332 (1990). https://doi.org/10.1007/BF01787700

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787700

Keywords

Navigation