Construction of Combinatorial Objects

Construction of Combinatorial Objects (1995)

by R. Laue

User correction supplied by mph

Datum	Value	Source
TITLE	Construction of Combinatorial Objects	SVM HeaderParse 0.1
AUTHOR NAME	R. Laue	user correction
AUTHOR AFFIL	Universitat Bayreuth, Lehrstuhl II fur Mathematik (Informatik)	user correction
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.	user correction
YEAR	1995	user correction - Legacy Corrections
CITATIONS	70 found	ParsCit 1.0