Results 1 
3 of
3
Construction of Combinatorial Objects
, 1995
"... 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, u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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.
Algorithms for Group Actions: Homomorphism Principle and Orderly Generation Applied to Graphs
 OF DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1996
"... The generation of discrete structures up to isomorphism is interesting as well for theoretical as for practical purposes. Mathematicians want to look at and analyse structures and for example chemical industry uses mathematical generators of isomers for structure elucidation. The example chosen in t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The generation of discrete structures up to isomorphism is interesting as well for theoretical as for practical purposes. Mathematicians want to look at and analyse structures and for example chemical industry uses mathematical generators of isomers for structure elucidation. The example chosen in this paper for explaining general generation methods is a relatively far reaching and fast graph generator which should serve as a basis for the next more powerful version of MOLGEN, our generator of chemical isomers.
Algebraic Combinatorics in Bayreuth
, 1995
"... I should like to give a brief introduction of our group, describe its main activities in the field of Algebraic Combinatorics, and illustrate them by a few typical examples. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
I should like to give a brief introduction of our group, describe its main activities in the field of Algebraic Combinatorics, and illustrate them by a few typical examples. 1