Abstract
In the present paper we describe the use of group actions, double cosets and homomorphisms in the constructive theory of discrete structures, as we found it useful from both a theoretical and a practical point of view. By means of examples we should like to demonstrate that these methods are useful both as unifying principles and as efficient methods for applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burnside, W.: Theory of Groups of Finite Order, 2nd edn, Dover, New York, 1955, p. 238.
Faradžev, I. A.: Constructive enumeration of combinatorial objects, Colloques internationaux C.N.R.S. No. 260 - Problèmes combinatoires et théorie des graphes, C.N.R.S., Paris, 1978, 131-135.
Faradžev, I. A., Klin, M. H. and Muzichuk, M. E.: Cellular rings and groups of automorphisms of graphs, in: I. A. Faradžev, A. A. Ivanov, M. H. Klin and A. J. Woldar (eds), Investigations in Algebraic Theory of Combinatorial Objects, Kluwer Academic Publ., Dordrecht, 1994, pp. 1-152.
Hager, R., Kerber, A., Laue, R., Moser, D and Weber, W.: Construction of orbit representatives, Bayreuther Math. Schr. 35(1991), 157-169.
Grund, R., Kerber, A. and Laue, R.: MOLGEN, ein Computeralgebra-System für die Konstruktion molekularer Graphen, Comm. Math. Chem. 27(1992), 87-131.
Hall, P.: On groups of automorphisms, J. Reine Angew. Math. 182(1940), 194-204.
Kalužnin, L. A., Beleckij, P. M. and Fejnberg, V. Z.: Kranzprodukte, Teubner-Texte zur Mathematik 101, B. G. Teubner Verlagsgesellschaft, Leipzig, 1987.
Kalužnin, L. A. and Klin, M. H.: On certain maximal subgroups of symmetric and alternating groups, Math. USSR Sbornik 16(1) (1972), 95-123.
Kalužnin, L. A. and Suščanskij, V. I.: Transformationen und Permutationen, Deutsch Taschenbücher, Band 49, Verlag Harry Deutsch, Thun und Frankfurt am Main, 1986.
Kalužnin, L. A., Suščanskij, V. I. and Ustimenko, V. A.: Application of electronic computers in the theory of substitution groups and its applications, Cybernetics 18(6) (1983), 804-819.
Kerber, A.: Algebraic Combinatorics via Finite Group Actions, BI-Wissenschaftsverlag, 1991.
Klin, M. H.: On the number of graphs for which a given permutation group is the automorphism group, Kibernetika 6(1970), 131-137.
Kramer, E. S. and Mesner, D. M.: t-designs on hypergraphs, Discrete Math. 15(1976), 263- 296.
Laue, R.: Eine konstruktive Version des Lemmas von Burnside, Bayreuther Math. Schr. 28(1989), 111-125.
Laue, R.: Construction of combinatorial objects - A tutorial, Bayreuther Math. Schr. 43(1993), 53-96.
Littlewood, D. E.: The Theory of Group Characters and Matrix Representations of Groups, 2nd edn, Clarendon Press, Oxford, 1959, p. 165 ff.
Read, R. C.: Every one a winner, Ann. Discrete Math. 2(1978), 107-120.
Read, R. C. and Corneil, D. C.: The graph isomorphism disease, J. Graph Theory 1(1977), 339-363.
Ruch, E., Hässelbarth, W. and Richter, B.: Doppelnebenklassen als Klassenbegriff und Nomenklaturprinzip für Isomere und ihre Abzählung, Theor. Chim. Acta(Berlin) 19(1970), 288-300.
Schmalz, B.: The t-designs with prescribed automorphism group, new simple 6-designs, J. Combin. Designs 1(1993), 125-170.
Slepian, D.: Some further theory of group codes, in: I. F. Blake (ed.), Algebraic Coding Theory: History and Development(Benchmark papers in electrical engineering and computer science), Dowden, Hutchinson & Ross Inc., Stroudsburg, 1973, pp. 118-151.
Weinrich, S.: Konstruktionsalgorithmen für diskrete Strukturen und ihre Implementierung, Díplomarbeit Bayreuth, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kerber, A., Laue, R. Group Actions, Double Cosets, and Homomorphisms: Unifying Concepts for the Constructive Theory of Discrete Structures. Acta Applicandae Mathematicae 52, 63–90 (1998). https://doi.org/10.1023/A:1005998722658
Issue Date:
DOI: https://doi.org/10.1023/A:1005998722658