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
How to Cite
References
Jacques Touchard (1950) Contribution à l'étude du problème des timbres poste. 2, 385-398.
Martin Gardner (1983) The combinatorics of paper folding. 60-73.
John Koehler (1968) Folding a strip of stamps. 5(2), 135-152.
Joe Sawada, Roy Li (2012) Stamp foldings, semi-meanders, and open meanders: fast generation algorithms. 19(2), 16.
Ryuhei Uehara (2010) On Stretch Minimization Problem on Unit Strip Paper. 22, 223-226.
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto (2013) The complexity of the stamp folding problem. 497, 13-19.
Published
2023-04-13
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.