Abstract

Abstract We provide a definition of a diametric magic circle of order n. In this paper, we use techniques in computational algebraic combinatorics and enumerative geometry to construct and to count d-magic circles. We also provide a description of its minimal Hilbert basis and determine the symmetry operations on d-magic circles. Finally, we give an algorithm for writing a natural d-magic circle in terms of the minimal Hilbert basis.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.