Cartesian Magicness of 3-Dimensional Boards
Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu

TL;DR
This paper explores the concept of Cartesian magicness in 3D boards, generalizing magic rectangles into three dimensions, and provides conditions for their existence using matrix approaches involving magic squares and rectangles.
Contribution
It introduces the notions of Cartesian tri-magic, bi-magic, and magic boards, and establishes conditions for their existence, including a simplified proof that all (p,p,p)-boards are Cartesian magic.
Findings
Established sufficient conditions for Cartesian tri-magic boards.
Derived necessary and sufficient conditions for Cartesian bi-magic and magic boards.
Proved that all (p,p,p)-boards are Cartesian magic with a simplified proof.
Abstract
A -board that has squares consists of a -, a -, and a -rectangle. Let be the set of the squares. Consider a bijection . Firstly, for , let be the sum of all the integers in the -th row of the -rectangle. Secondly, for , let be the sum of all the integers in the -th row of the -rectangle. Finally, for , let be the the sum of all the integers in the -th row of the -rectangle. Such an assignment is called a -design if for some constant , for some constant , and for some constant . A -board that admits a -design is called (1) Cartesian tri-magic if , and are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
