Papers
Topics
Authors
Recent
Search
2000 character limit reached

Origami rings

Published 11 Nov 2010 in math.CO and math.NT | (1011.2769v1)

Abstract: Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_\alpha(p)$ be the line in the complex plane through $p$ with angle $\alpha$ (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_\alpha(p) \cap L_\beta(q)$, where $p, q$ have been constructed already, and $\alpha, \beta$ 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\pi/n$, $0 \le k < n$, then $\RU$ is the ring $\Z[\zeta_n]$ if $n$ is prime, and the ring $\Z[1/n,\zeta_{n}]$ if $n$ is not prime, where $\zeta_n := \exp(2\pi i/n)$ is a primitive $n$-th root of unity.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.