Mathematics – Combinatorics
Scientific paper
2008-10-08
Mathematics
Combinatorics
We include a reference to a paper of Victor Makeev and acknowledge his priority in proving our Theorem 11 (related to Hadwiger
Scientific paper
The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n distinct, labelled points on the circle S^1. The "polygonal pegs problem" asks whether every simple, closed curve in the plane or in the higher dimensional space admits an inscribed polygon of a given shape. We develop a new approach to the polygonal pegs problem based on the Fulton-MacPherson (Axelrod-Singer, Kontsevich) compactification of the configuration space of (cyclically) ordered n-element subsets in S^1. Among the results obtained by this method are proofs of Grunbaum's conjecture about affine regular hexagons inscribed in smooth Jordan curves and a new proof of the conjecture of Hadwiger about inscribed parallelograms in smooth, simple, closed curves in the 3-space (originally established by Victor Makeev).
Vrecica Sinisa
Zivaljevic Rade
No associations
LandOfFree
Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30206