Theory of linear and integer programming
Theory of linear and integer programming
Hi-index | 0.00 |
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.