.svg){kind=logo}
ORDER THEORY IN STRIP FOLDING
Keywords:
order theory, strip folding, sheaf.DOI:
https://doi.org/10.17654/0972555523019Abstract
Despite of considerable algorithmic research on strip folding, an abstract mathematical approach to this topic is yet to be established. This paper demonstrates the possibility of constructing an ordering system within the framework of strip folding, and subsequently develops a unique systematized order theory in this context. In this study, we first utilize basic terms from order theory to arrange the relationship between folding objects and folding processes, avoiding the use of complicated terms from category theory. Next, we discuss various topics related to the representation of different folding models within this system, the meet and join operations of the preorder defined in this paper, upper sets, and their corresponding functors. In doing so, we limit our use of category theory to the minimum necessary and use a more accessible approach that utilizes fundamental concepts from order theory. Furthermore, graph theory is employed to represent the ordering system, and a sheaf structure is defined based on the graph. This methodology enables the efficient representation of strip folding in an abstract manner, thus, facilitating the exploration of various algebraic and abstract geometric structures, including sheaves and sites, among others.
Received: June 28, 2023
Accepted: August 1, 2023
References
Edward J. McShane, Order-preserving Maps and Integration Processes, Vol. 31, Princeton University Press, 1954.
Abraham Adolf Fraenkel, Yehoshua Bar-Hillel and Azriel Levy, Foundations of Set Theory, Elsevier, 1973.
Brendan Fong and David I. Spivak, Seven sketches in compositionality: an invitation to applied category theory, 2018. arXiv:1803.05316.
R. C. Backhouse and M. L. L. Bijsterveld, Category theory as coherently constructive lattice theory: an illustration, Eindhoven University of Technology, Department of Mathematics and Computing Science, 1994.
R. Ghrist and H. Riess, Cellular sheaves of lattices and the Tarski Laplacian, 2020. arXiv:2007.04099.
B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 2002.
Manuel Graña, A brief review of lattice computing, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), 2008.
M. Bern and B. Hayes, The complexity of flat origami, Ann. ACM-SIAM Symposium on Discrete Algorithms, ACM, 1996, pp. 175-183.
E. M. Arkin, M. A. Bender, E. D. Demaine, M. L. Demaine, J. S. B. Mitchell, S. Sethia and S. S. Skiena, When can you fold a map? Comput. Geom. 29(1) (2004), 23-46.
H. A. Akitaya, K. C. Cheung, E. D. Demaine, T. Horiyama, T. C. Hull, J. S. Ku, T. Tachi and R. Uehara, Box pleating is hard, JCDCGG, Japan, 2016, pp. 167-179.
E. D. Demaine and J. O’Rourke, Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press, 2007.
E. D. Demaine, S. L. Devadoss, J. S. Mitchell and J. O’Rourke, Continuous foldability of polygonal paper, CCCG, 2004, pp. 64-67.
R. I. Nishat, Map folding, Doctoral Dissertation, 2013.
Yiyang Jia and Jun Mitani, Making strip folding a monoidal category, JP Journal of Algebra, Number Theory and Applications 61(1) (2023), 1-18.
J. Hansen and R. Ghrist, Toward a spectral theory of cellular sheaves, Journal of Applied and Computational Topology 3(4) (2019), 315-358.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 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.
