Abstract

Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, and computing Sylow subgroups of automorphism groups can be explained in this way. The exposition is based on graph theoretic concepts to give an easy explanation of data structures for group actions.

Citations

8880	Computers and Intractability: A Guide to the Theory of NPCompleteness - Garey, Johnson - 1979
271	A Course in Combinatorics - Lint, Wilson - 1992
243	The theory of groups - Hall - 1976
152	Lattice basis reduction: Improved practical algorithms and solving subset sum problems - Schnorr, Euchner - 1994
115	Isomorphism of graphs of bounded valence can be tested in polynomial time - Luks - 1982
81	Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbindungen,” Acta Mathematica - Pólya - 1937
80	Solving low-density subset sum problems - Lagarias, Odlyzko - 1983
60	An Improved Low-Density Subset Sum Algorithm - Coster, LaMacchia, et al. - 1991
46	Algebraic combinatorics via finite group actions. Bibliographisches Institut - Kerber - 1991
43	Sur les formes quadratiques - Korkine, Zolotarev
41	Fundamental Algorithms for Permutation Groups - BUTLER - 1991
40	Computation with permutation groups - Sims - 1971
38	Lovász: Factoring polynomials with rational coefficients - Lenstra, Jr, et al. - 1982
32	Application of Artificial Intelligence for Organic Chemistry - Lindsay, Buchanan, et al. - 1980
25	A compact representation for permutation groups - Jerrum - 1982
22	On realizability of a set of integers as degrees of vertices of a linear graph I - Hakimi - 1962
15	private communication - McKay, Allen
13	Some further theory of group codes - Slepian - 1960
12	Some remarks on the computation of complements and normalizers in soluble groups - Celler, Neubuser, et al.
12	t-designs on hypergraphs - Kramer, Mesner
12	Computing automorphisms and canonical labellings of graphs - MCKAY - 1978
12	The t-designs with prescribed automorphism group, new simple 6-designs - Schmalz - 1993
11	MOLGEN -- ein Computeralgebrasystem fur die Konstruktion molekularer Graphen. match - Grund, Kerber, et al. - 1992
10	A new base change algorithm for permutation groups - Brown, Finkelstein, et al. - 1989
10	A language for group theory - Cannon
10	Algorithms for finite soluble groups and the SOGOS system - NEUBÜSER, J, et al. - 1984
9	Constructive enumeration of incidence systems - Ivanov - 1985
9	Computing Automorphism Groups of Combinatorial Objects - Leon - 1984
8	and A Seress, Nearly linear time algorithms for permutation groups with a small base - Babai, Cooperman, et al.
8	Efficient algorithms for listing unlabeled graphs - Goldberg - 1992
7	Generating cubic graphs faster than isomorphism checking, preprint - Brinkmann - 1992
7	Algorithms for group actions applied to graph generation - Grüner, Laue, et al. - 1997
7	Descriptions of groups of primepower order - Newman, Nickel, et al. - 1998
6	Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und uberlappungsfreien Fragmenten - Grund - 1995
6	Datenstructuren und effiziente Algorithmen - Mehlhorn - 1988
6	Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen - Schmalz - 1990
6	t-Designs zu vorgegebener Automorphismengruppe - Schmalz - 1992
5	Pospichal: Canonical indexing and the constructive enumeration of molecular graphs - Kvasnicka, J - 1990
4	Brickell: Solving low density knapsacks - F - 1984
4	Construction of discrete structures, especially of chemical isomers - Grund, Kerber, et al.
4	Data structures in Pascal - Horowitz, Sahni - 1987
4	Radziszowski: Finding Simple t-Designs by Using Basis Reduction. Congressus Numerantium 55 - Kreher, P - 1986
4	Zur Konstruktion und Klassifikation endlicher auflosbarer Gruppen - Laue - 1982
4	Eine konstruktive Version des Lemmas von Burnside - Laue - 1989
4	Schnorr: A More Efficient Algorithm for Lattice Basis Reduction - P - 1988
4	Konstruktionsalgorithmen fur diskrete Strukturen und ihre - Weinrich - 1993
3	Bruijn, Pólya’s theory of counting - de
3	Faradzhev: Generation of nonisomorphic graphs with a given degree sequence (russian - A - 1978
3	Construction of orbit representatives - Hager, Kerber, et al. - 1991
3	Schnorr: A hierachy of polynomial time lattice basis reduction algorithms - P - 1987