PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Rotary polygons in configurations
Marko Boben, Štefko Miklavčič and Primož Potočnik
Electron. j. comb. (On line) Volume 18, Number 1, 119, 2011. ISSN 1077-8926

Abstract

A polygon A in a configuration C is called rotary if C admits an automorphism which acts upon A as a one-step rotation. We study rotary polygons and their orbits under the group of automorphisms (and antimorphisms) of C. We determine the number of such orbits for several symmetry types of rotary polygons in the case when C is flag-transitive. As an example, we provide tables of flag-transitive (v3) and (v4) configurations of small order containing information on the number and symmetry types of corresponding rotary polygons.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8196
Deposited By:Boris Horvat
Deposited On:21 February 2012