Recurrence Formula of Stamp Folding Problem
stamp folding problem, discrete mathematics, discrete geometry, folding, crease
Abstract
There is an unsolved problem that has plagued mathematicians for a long time, the "stamp folding problem" (strictly, is there a formula for counting the solutions to the stamp folding problem?). In this paper, I have succeeded in expressing the stamp-folding problem by a recurrence formula with an elegant idea.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
References
Jacques Touchard (1950) Contribution a L'etude Du Probleme Des Timbres Poste. 2, 385-398. https://doi.org/10.4153/cjm-1950-035-6
Martin Gardner (1983) The combinatorics of paper folding. 60-73.
John Koehler (1968) Folding a strip of stamps. 5(2), 135-152. https://doi.org/10.1016/s0021-9800(68)80048-1
Joe Sawada, Roy Li (2012) Stamp foldings, semi-meanders, and open meanders: fast generation algorithms. (2), 16.
Ryuhei Uehara (2010) On Stretch Minimization Problem on Unit Strip Paper, 22nd Canadian Conference on Computational Geometry. 223-226.
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto Complexity of the stamp folding problem, Theoretical computer Science, Vol. 497, 13-19.
Published
2023-02-20
Issue
Section
License
Copyright (c) 2023 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.