Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.08465

Hinged-rulers fold in $2-Θ(\frac{1}{2^{n/4}})$

Colin Tang
View original source ↗Read source document ↗Export metadata ↓

Abstract

A hinged-ruler is a sequence of line segments in the plane joined end-to-end with hinges, so each hinge joins exactly two segments, the first segment and last segment are adjacent to only one hinge each, and all other segments are adjacent to exactly two hinges. Hopcroft, Joseph, and Whitesides first posed the hinged-ruler-folding problem in their 1985 paper "On the Movement of Robot Arms in 2-Dimensional Bounded Regions": given a hinged-ruler and a real number $K$, can the hinged-ruler be folded so as to fit within a one-dimensional interval of length $K$? We show that if the segment lengths are constrained to be real numbers in the interval $[0,1]$, then we can always fold the hinged-ruler so as to fit within a one-dimensional interval of length $2-Ω(\frac{1}{2^{n/4}})$. On the other hand, we give a construction for a hinged-ruler which cannot be folded into some one-dimensional interval of length $2-O(\frac{1}{2^{n/4}})$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Colin Tang. 2023-08-23. Hinged-rulers fold in $2-Θ(\frac{1}{2^{n/4}})$. https://arxiv.org/abs/2301.08465

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗