Related papers: Splitting loops and necklaces: Variants of the squ…
The "square peg problem" or "inscribed square problem" of Toeplitz asks if every simple closed curve in the plane inscribes a (non-degenerate) square, in the sense that all four vertices of that square lie on the curve. By a variety of…
The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…
Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
A parallelogram is conformally inscribed in four lines in the plane if it is inscribed in a scaled copy of the configuration of four lines. We describe the geometry of the three-dimensional Euclidean space whose points are the…
Building on a result by Tao, we show that a certain type of simple closed curve in the plane given by the union of the graphs of two $1$-Lipschitz functions inscribes a square whose sidelength is bounded from below by a universal constant…
A necklace splitting theorem of Goldberg and West asserts that any k-colored (continuous) necklace can be fairly split using at most k cuts. Motivated by the problem of Erd\H{o}s on strongly nonrepetitive sequences, Alon et al. proved that…
We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by…
In 1958, S. \'Swierczkowski proved that there cannot be a closed loop of congruent interior-disjoint regular tetrahedra that meet face-to-face. Such closed loops do exist for the other four regular polyhedra. It has been conjectured that,…
We construct a version of Lagrangian Floer homology whose chain complex is generated by the inscriptions of a rectangle into a real analytic Jordan curve. By using its associated spectral invariants, we establish that a rectifiable Jordan…
The square peg problem asks whether every Jordan curve in the plane has four points which form a square. The problem has been resolved (positively) for various classes of curves, but remains open in full generality. We present two new…
When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…
Hadwiger's conjecture asserts that any graph contains a clique minor with order no less than the chromatic number of the graph. We prove that this well-known conjecture is true for all graphs if and only if it is true for squares of split…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
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…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
We prove a multiplicity result for rectangular pegs that there is a generic class of smooth Jordan curves in which every curve admits two geometrically distinct similar inscribed rectangles with aspect angle in $(0,\frac{\pi}{2})$, based on…
The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to \R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d=1, and if q is a prime power, but not yet in general.) The…