Bern, M.; Demaine, E.; Eppstein, D.; and Hayes, B. "A Disk-Packing Algorithm for an Origami Magic Trick." In Proc. Third Internat. Meeting of Origami Science, Math, and Education, Monterey, California, March 2001. pp. 17-28.Bern, M.; Demaine, E.; Eppstein, D.; and Hayes, B. "A Disk-Packing Algorithm for an Origami Magic Trick." Proc. Internat. Conference of Fun with Algorithms, Isola d'Elba, Italy, June 1998. pp. 32-42.Cundy, H. and Rollett, A. Mathematical Models, 3rd ed. Stradbroke, England: Tarquin Pub., 1989.Demaine, E. K. and Demaine, M. L. "Fold-and-Cut Magic." In Tribute to a Mathemagician (Ed. B. Cipra, E. D. Demaine, M. L. Demaine, and T. Rodgers). Wellesley, MA: A K Peters, pp. 23-30, 2004.Demaine, E. K.; Demaine, M. L.; and Lubiw, A. "Folding and Cutting Paper." It Revised Papers from the Japan Conference on Discrete and Computation Geometry (Ed. J. Akiyama, M. Kano, and M. Urabe). Tokyo, Japan, pp. 104-117, 1998.Demaine, E. K.; Demaine, M. L.; and Lubiw, A. "Folding and Straight Cut Suffice." In Proc. 10th Annual ACM-SIAM Symposium Disc. Alg. Baltimore, MD: ACM Press, pp. 891-892, 1999.Gallivan, B. C. "How to Fold Paper in Half Twelve Times: An 'Impossible Challenge' Solved and Explained." Pomona, CA: Historical Society of Pomona Valley, 2002.Gardner, M. "Mathematical Games: Recreations Involving Folding and Cutting Sheets of Paper." Sci. Amer.202, 161-170, Jun. 1960.Gardner, M. "Paper Cutting." Ch. 5 in Martin Gardner's New Mathematical Diversions from Scientific American. New York: Simon and Schuster, pp. 58-69, 1966.Gardner, M. "Single-Cut Stunts." In Encyclopedia of Impromptu Magic. Chicago, IL: Magic, Inc., pp. 424-428, 1978.Gurkewitz, R. and Arnstein, B. Multimodular Origami Polyhedra: Archimedeans, Buckyballs, and Duality. New York: Dover, 2003.Hilton, P.; Holton, D.; and Pedersen, J. "Paper-Folding and Number Theory." Ch. 4 in Mathematical Reflections in a Room with Many Mirrors. New York: Springer-Verlag, pp. 87-142, 1997.Houdini, H. Houdini's Paper Magic: The Whole Art of Performing with Paper, Including Paper Tearing, Paper Folding and Paper Puzzles. New York: Dutton, 1922.Klein, F. "Famous Problems of Elementary Geometry: The Duplication of the Cube, the Trisection of the Angle, and the Quadrature of the Circle." In Famous Problems and Other Monographs. New York: Chelsea, p. 42, 1980.Legman, G. Bibliography of Paper-Folding. Malvern, England: Priory Press, 1952.Loe, G. M. Paper Capers. Chicago, IL: Magic, Inc., 1955.Math@Home. "Amazing Paperfolding Fact." http://educ.queensu.ca/~fmc/june2002/PaperFact.htm. June 2002."National Standards and Emblems." Harper's New Monthly Magazine47, No. 278, 171-181, July 1873.PBS Kids. "Paper Fold." http://pbskids.org/zoom/activities/phenom/paperfold.html.Peterson, I. "MathTrek: Folding Paper in Half--Twelve Times." Jan. 24, 2004. http://www.sciencenews.org/20040124/mathtrek.asp.Pomona Valley Historical Society. "How to Fold Paper in Half Twelve Times." http://pomonahistorical.org/12times.htm.Sabinin, P. and Stone, M. G. "Transforming -gons by Folding the Plane." Amer. Math. Monthly102, 620-627, 1995.Sloane, N. J. A. Sequences A007494 and A076024 in "The On-Line Encyclopedia of Integer Sequences."Sundra Row, T. Geometric Exercises in Paper Folding. New York: Dover, 1966.Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, 1986.Wells, D. The Penguin Dictionary of Curious and Interesting Geometry. London: Penguin, pp. 191-192, 1991.Wertheim, M. "Origami as the Shape of Things to Come." The New Your Times, Section F, Column 1, p. 1. Feb. 15, 2005.
邊形（對於 
）所需的最少摺疊次數尚不清楚，但已知一些邊界。特別地，每組 
個點都是一個合適的正 
邊形在最多 
次摺疊下的影像，其中
可訪問的點，且這些摺疊保持 
, ..., 
固定，恰好是那些位於或在透過 
且中心位於 
的圓的交集邊界內的點，對於 
, ..., 
。給定平面上的任意三個點 
、
和 
，存在一個等邊三角形，其多邊形頂點為 
、
和 
，其中 
、
和 
是 
、
和 
在單次摺疊下的影像。
、
、
和 
，存在一個正方形，其多邊形頂點為 
、
、
和 
，其中 
、
、
和 
是 
、
、
和 
在最多三次摺疊序列下的影像。此外，任何四個共線點都是一個合適的正方形的多邊形頂點在最多兩次摺疊下的影像。每五個（六個）點都是一個合適的正五邊形（六邊形）的多邊形頂點在最多五次（六次）摺疊下的影像。
米的紙堆，再摺疊一次，紙堆的高度將超過地球與太陽之間的距離。
是材料的最小可能長度，
是厚度，
是給定方向上可能的摺疊次數。這個公式表明了在 
次摺疊中損失了多少“標準化”紙張，從而限制了有限厚度的物體在一個方向上可以摺疊的次數 (波莫納谷歷史學會)。對於 
, 1, 2, ... 序列 
給出 0, 1, 4, 14, 50, 186, 714, ... (OEIS A076024)。這個公式是由高中生 Britney Gallivan 在 2001 年 12 月推匯出來的。Britney 隨後在 2002 年 1 月創造了一項新的世界紀錄，她先是將金箔對摺，然後將紙張對摺了驚人的 12 次，從而推翻了 Math@Home 和 PBS Kids 關於紙張對摺次數不能超過八次的說法。Britney 和她的壯舉在電視犯罪劇集NUMB3RS第一季的劇集“身份危機”（2005 年）中被提及。
-gons by Folding the Plane." Amer. Math. Monthly 102, 620-627, 1995.Sloane, N. J. A. Sequences