
TL;DR
This paper enumerates specific symmetric and rotationally invariant polygons with 3m vertices, providing complete classifications and formulas for their counts, advancing combinatorial understanding of symmetric polygon structures.
Contribution
It introduces new enumeration methods for polygons with particular symmetry and rotational properties, including complete classifications and explicit formulas.
Findings
Counted polygons with m symmetry axes among 3m-vertices polygons.
Enumerated polygons invariant under rotations but lacking symmetry axes.
Provided formulas for the number of such polygons.
Abstract
The present article includes the enumeration of -polygons with two certain symmetry properties: For a number of vertices, we count the -polygons with symmetry axes and the -polygons, that match after three elementary rotations, but have no symmetry axes. For those polygons we give complete lists of representatives of their equivalence-classes and closed formulas for their number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Advanced Combinatorial Mathematics
