Splitting loops and necklaces: variants of the square peg problem
From MaRDI portal
Abstract: Toeplitz conjectured that any simple planar loop inscribes a square. Here we prove variants of Toeplitz' square peg problem. We prove Hadwiger's 1971 conjecture that any simple loop in -space inscribes a parallelogram. We show that any simple planar loop inscribes sufficiently many rectangles that their vertices are dense in the loop (independently due to Schwartz). If the loop is rectifiable, there is a rectangle that cuts the loop into four pieces that can be rearranged to form two loops of equal length. A rectifiable loop in -space can be cut into pieces that can be rearranged by translations to form loops of equal length. We relate our results to fair divisions of necklaces in the sense of Alon and to Tverberg-type results. This provides a new approach and a common framework to obtain variants of Toeplitz' square peg problem for the class of all continuous curves.
Recommendations
Cites work
- A Moment Problem in L 1 Approximation
- A survey on the square peg problem
- A trichotomy for rectangles inscribed in Jordan loops
- An integration approach to the Toeplitz square peg problem
- Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
- Barycenters of polytope skeleta and counterexamples to the topological Tverberg conjecture, via constraints
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Fair division and generalizations of Sperner- and KKM-type results
- Fair splitting of colored paths
- Finite sets on curves and surfaces
- Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem
- scientific article; zbMATH DE number 3776487 (Why is no real title available?)
- scientific article; zbMATH DE number 3098193 (Why is no real title available?)
- Inscribed squares and square‐like quadrilaterals in closed curves
- Measure partitions using hyperplanes with fixed directions
- Optimal bounds for the colored Tverberg problem
- Proof of a conjecture of H. Hadwiger
- Quadrangles inscribed in a closed curve and the vertices of a curve
- Quadrilaterals inscribed in convex curves
- Rhombi inscribed in simple closed curves
- Simple proofs of some Borsuk-Ulam results
- Splitting multidimensional necklaces
- Splitting necklaces
- Thieves can make sandwiches
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Cited in
(13)- The rectangular peg problem
- Configuration spaces, multijet transversality, and the square-peg problem
- A trichotomy for rectangles inscribed in Jordan loops
- Combinatorial necklace splitting
- An integration approach to the Toeplitz square peg problem
- A nonlinear Lazarev-Lieb theorem: \(L^2\)-orthogonality via motion planning
- Families of similar simplices inscribed in most smoothly embedded spheres
- Four lines and a rectangle
- Rectangles, curves, and Klein bottles
- scientific article; zbMATH DE number 7647199 (Why is no real title available?)
- Pushing a rectangle down a path
- Fat triangles inscribed in arbitrary planar domains
- On inscribed trapezoids and affinely 3-regular maps
This page was built for publication: Splitting loops and necklaces: variants of the square peg problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210688)
