.svg){kind=logo}
COMBINATORICS AND ALGEBRA OF $1 × n$ CYCLIC STAMP FOLDING
Keywords:
cyclic stamp folding, monoidal category, semilatticeDOI:
https://doi.org/10.17654/0972555525026Abstract
This paper investigates the algebraic properties of $1 × n$ cyclic stamp folding, contrasting them with those of traditional $1 × n$ stamp folding. While the set of partially folded states for standard stamp folding forms a Heyting algebra, the set of partially folding states of the cyclic stamp folding under a partial order based on contacting faces forms only a join-semilattice, as a “meet” operation is not universally defined. This incomplete structure necessitates the search for a more descriptive algebraic framework.
To achieve this, we analyzed the combinatorial structure of the folded states and identified a minimal generating set composed of two fundamental patterns: “stars” (alternating mountain-valley folds) and “trees” (consecutive mountain or valley folds). Any valid folded state can be constructed from a combination of these basic components. Based on this generating set, we define a category for the set of all final folded states. We demonstrate that this category is a monoidal category, where the tensor product allows for the construction of complex folded states from simpler ones. This provides a novel and more comprehensive algebraic structure for $1 × n$ cyclic stamp folding.
Received: June 20, 2025
Accepted: July 21, 2025
References
[1] H. A. Akitaya, E. D. Demaine and J. S. Ku, Simple folding is really hard, Journal of Information Processing 25 (2017), 580-589.
[2] M. Bern and B. Hayes, The complexity of flat origami, Ann. ACM-SIAM Symposium on Discrete Algorithms, ACM, 1996, pp. 175-183.
[3] Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara and Yushi Uno, Folding a paper strip to minimize thickness, WALCOM: Algorithms and Computation: 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings 9, Springer, 2015, pp. 113-124.
[4] Thomas Hull, The combinatorics of flat folds: a survey, Origami3: Proceedings of the 3rd International Meeting of Origami Science, Math and Education, 2002, pp. 29-38.
[5] Yiyang Jia and Jun Mitani, Heyting algebra in flat origami, JP Journal of Algebra, Number Theory and Applications 63(5) (2024), 383-396.
[6] J. Justin, Towards a mathematical theory of origami, International Meeting of Origami Science and Scientific Origami, K. Miura, ed., 1996, pp. 15-29.
[7] T. Kawasaki, On the relation between mountain-creases and valley-creases on a flat origami, International Meeting of Origami Science and Technology, H. Huzita, ed., 1989, pp. 229-237.
[8] John E. Koehler, Folding a strip of stamps, Journal of Combinatorial Theory 5(2) (1968), 135-152.
[9] Ryuhei Uehara, Stamp foldings with a given mountain-valley assignment, Origami5: Proceedings of the 5th International Meeting of Origami Science, Mathematics, and Education (AK Peters/CRC Press, 2011), 2011, pp. 585-597.
[10] Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara and Hiro Ito, Complexity of the stamp folding problem, International Conference on Combinatorial Optimization and Applications, Springer, 2011, pp. 311-321.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA
This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________________
Attribution: Credit Pusha Publishing House as the original publisher, including title and author(s) if applicable.
Non-Commercial Use: For non-commercial purposes only. No commercial activities without explicit permission.
No Derivatives: Modifying or creating derivative works not allowed without written permission.
Contact Pusha Publishing House for more info or permissions.
