Search arXivSearch

arXiv · 1011.2769

Origami rings

Abstract

Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_α(p)$ be the line in the complex plane through $p$ with angle $α$ (with respect to the real axis). Given a fixed collection $U$ of angles, let $\RU$ be the points that can be obtained by starting with $0$ and $1$, and then recursively adding intersection points of the form $L_α(p) \cap L_β(q)$, where $p, q$ have been constructed already, and $α, β$ are distinct angles in $U$. Our main result is that if $U$ is a group with at least three elements, then $\RU$ is a subring of the complex plane, i.e., it is closed under complex addition and multiplication. This enables us to answer a specific question about origami folds: if $n \ge 3$ and the allowable angles are the $n$ equally spaced angles $kπ/n$, $0 \le k < n$, then $\RU$ is the ring $\Z[ζ_n]$ if $n$ is prime, and the ring $\Z[1/n,ζ_{n}]$ if $n$ is not prime, where $ζ_n := \exp(2πi/n)$ is a primitive $n$-th root of unity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joe Buhler, Steve Butler, Warwick de Launey, Ron Graham. 2010-11-11. Origami rings. https://arxiv.org/abs/1011.2769

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

KEEP EXPLORING

Related papers

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

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