Non-magic Hypergraphs
Benjamin Ellis, David A. Nash, Jonathan Needleman, and Michael Raney

TL;DR
This paper explores the generalization of magic labelings from squares to hypergraphs, providing algorithms to determine such labelings over abelian groups and applying them to classify certain configurations.
Contribution
It introduces algorithms for identifying magic labelings in hypergraphs over abelian groups and integers, extending the concept beyond traditional magic squares.
Findings
Developed an algorithm for hypergraph magic labelings over abelian groups
Extended the algorithm to determine magic labelings over integers
Counted magic configurations for specific hypergraph sizes
Abstract
This article studies a generalization of magic squares to -uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized to allow for labels coming from any abelian group. We demonstrate an algorithm for determining whether a given hypergraph has a magic labeling over some abelian group. A slight adjustment of this algorithm also allows one to determine whether a given hypergraph can be magically labeled over . As a demonstration, we use these algorithms to determine the number of magic -configurations for .
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.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Digital Image Processing Techniques
