Group Actions, Double Cosets, and Homomorphisms: Unifying Concepts for the Constructive Theory of Discrete Structures

Acta Applicandae Mathematicae

Volumn 52, Issue 1-3, 1998, Pages 63-90

  Kerber, Adalbert ^a   Laue, Reinhard ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Codes; Constructive combinatorics; Designs; Graphs; Group actions; Solvable groups

Indexed keywords

EID: 0012063085     PISSN: 01678019     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1005998722658     Document Type: Article

References (22)

1. Burnside, W.: Theory of Groups of Finite Order, 2nd edn, Dover, New York, 1955, p. 238.
2. 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.
3. 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.
4. Hager, R., Kerber, A., Laue, R., Moser, D and Weber, W.: Construction of orbit representatives, Bayreuther Math. Schr. 35 (1991), 157-169.
5. Grund, R., Kerber, A. and Laue, R.: MOLGEN, ein Computeralgebra-System für die Konstruktion molekularer Graphen, Comm. Math. Chem. 27 (1992), 87-131.
6. Hall, P.: On groups of automorphisms, J. Reine Angew. Math. 182 (1940), 194-204.
7. Kalužnin, L. A., Beleckij, P. M. and Fejnberg, V. Z.: Kranzprodukte, Teubner-Texte zur Mathematik 101, B. G. Teubner Verlagsgesellschaft, Leipzig, 1987.
8. 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.
9. 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.
10. 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.
11. Kerber, A.: Algebraic Combinatorics via Finite Group Actions, BI-Wissenschaftsverlag, 1991.
12. Klin, M. H.: On the number of graphs for which a given permutation group is the automorphism group, Kibernetika 6 (1970), 131-137.
13. Kramer, E. S. and Mesner, D. M.: t-designs on hypergraphs, Discrete Math. 15 (1976), 263-296.
14. Laue, R.: Eine konstruktive Version des Lemmas von Burnside, Bayreuther Math. Schr. 28 (1989), 111-125.
15. Laue, R.: Construction of combinatorial objects - A tutorial, Bayreuther Math. Schr. 43 (1993), 53-96.
16. Littlewood, D. E.: The Theory of Group Characters and Matrix Representations of Groups, 2nd edn, Clarendon Press, Oxford, 1959, p. 165 ff.
17. Read, R. C.: Every one a winner, Ann. Discrete Math. 2 (1978), 107-120.
18. Read, R. C. and Corneil, D. C.: The graph isomorphism disease, J. Graph Theory 1 (1977), 339-363.
19. 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.
20. Schmalz, B.: The t-designs with prescribed automorphism group, new simple 6-designs, J. Combin. Designs 1 (1993), 125-170.
21. 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.
22. Weinrich, S.: Konstruktionsalgorithmen für diskrete Strukturen und ihre Implementierung, Diplomarbeit Bayreuth, 1993.