Monochromatic Regular Polygons in finitely colored $\mathbb{Z}_2 *\mathbb{Z}_2 *\mathbb{Z}_2$
Hui Xu, Enhui Shi

TL;DR
This paper proves that in any finite coloring of the free product of three cyclic groups of order two, there always exists a monochromatic regular polygon of any size, with bounds on the edge length.
Contribution
It establishes the existence of monochromatic regular polygons in finitely colored free products of three groups, extending geometric Ramsey theory to this algebraic setting.
Findings
Existence of monochromatic regular k-gons for all k
Bounds on the edge length of these polygons
Application of combinatorial and geometric methods
Abstract
We show that for any finite coloring of the group and for any positive integer , there always exists a monochromatic regular -gon in with respect to the word length metric induced by the standard generating set; the edge length of which is estimated.
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems
