Sets with involutions: Power group enumeration

Authors:
Michael Hofmeister
Affiliations:
Siemens AG, Munich, Corporate Technology, Department of Discrete Optimization, Germany
Venue:
European Journal of Combinatorics
Year:
2010

Citing 5
Cited 0

A contribution to the theory of voltage graphs

Discrete Mathematics
Topological graph theory

Topological graph theory
Isomorphisms and automorphisms of graph coverings

Discrete Mathematics
Enumeration of Concrete Regular Covering Projections

SIAM Journal on Discrete Mathematics
Isomorphism Classes of Concrete Graph Coverings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is a generalization of the well known classical power group enumeration by using sets with involutions instead of unstructured sets. The project to establish this was triggered by the rapid growth of topological enumeration, which used counting principles so far rather ''ad hoc'', starting always from Cauchy-Frobenius's lemma directly. In addition, using the new counting principles throws a new light on classical counting problems from graphical enumeration which have been solved so far with conventional methods.