SearcharxivSearch

arXiv subjects

Donghwi Park

Publications and source records attributed to Donghwi Park.

4 recordsLinked to original sources

Trihexagonal Magic Figures: A High-Constraint-Density Triangular Combinatorial Design and the Possibility of a Phase Transition

We introduce a new class of magic figures defined on a finite triangular region of the trihexagonal tiling. The vertices of the region are labeled with the integers $1,2,\dots,3n(n+1)/2$, each used exactly once. The labeling is called \textbf{trihexagonal magic figure of order $n$} if all triangular faces have the same vertex-sum and all hexagonal faces have the same vertex-sum, with the latter equal to twice the former. We note three immediate structural features. First, the ratio between the number of independent constraints and the number of variables approaches $1$ as $n\to\infty$, indicating that the system is asymptotically tight. Second, a necessary parity condition arises: since the labeling uses the integers $1,2,\dots,3n(n+1)/2$, the total number of vertices must be odd, which holds if and only if $n \equiv 1$ or $2 \pmod{4}$. Third, the vertex set forms a perfectly regular triangular boundary, so the configuration has an exact polygonal symmetry without boundary irregularities.

math.GM

A construction of magic 24-cells

I found a novel class of magic square analogue, magic 24-cell. The problem is to assign the consecutive numbers 1 through 24 to the vertices in a graph, which is composed of 24 octahedra and 24 vertices, to make the sum of the numbers of each octahedron the same. It is known that there are facet-magic and face-magic labelings of tesseract. However, because of 24-cell contains triangle, face-magic labeling to assign different labels to each vertex is impossible. So I tried to make a cell-magic labeling of 24-cell. Linear combination of three binary labeling and one ternary labeling gives 64 different magic labelings of 24-cell. Due to similarity in the number of vertices between 5x5 magic square and magic 24-cell, It might be possible to calculate the number of magic 24-cell. Further analysis would be need to determine the number of magic 24-cell.

math.GM

Space-state complexity of Korean chess and Chinese chess

This article describes how to calculate exact space-state complexities of Korean chess and Chinese chess. The state-space complexity (a.k.a. search-space complexity) of a game is defined as the number of legal game positions reachable from the initial position of the game. The number of exact space-state complexities are not known for most of games. However, we calculated actual space-state complexities of Korean chess and Chinese chess.

math.GM

Range of magic constant on Hexagonal Tortoise Problem

Hexagonal tortoise problem (HTP), also known as Jisuguimundo or Jisugwimundo, is a magic square variety which was invented by medieval Korean Mathematician and minister Suk-Jung Choi (1646-1715).[1] Choi showed pattern 30 vertices 3 by 3 diagonal shape which has 93 as its magic constant. Unlike magic square, vertices in Jisugwimundo counted one times, twice or three times. This change makes magic constant of Hexagonal Tortoise Problem could be vary. We consider a range of hexagonal sums in various Jisugwimundo. In this paper, we decomposed vertices on Jisugwimundo to some groups. by this way we found the range of magic constant on several HTP.

math.HO