• 한국수학사학회지
• /
• 제23권3호
• /
• pp.21-31
• /
• 2010

2006년 이전까지도 유럽의 오일러가 직교라틴방진의 첫 연구자로서 인정을 받아왔다. 그러나 오일러 이전에 조선의 최석정이 오일러 이전에 이미 9차의 직교라틴 방진을 만들었다는 사실이 2006년 출판된 '조합론 디자인 편람' 에 소개됨으로써 우리만 알고 있던 사실이 세계적으로 공인되었다. 본 논문에서는 최석정과 양휘산법의 마방진을 비교하고 세계최초로 만들어진 최석정의 직교라틴방진과 오일러 가설의 역사를 설명한다.

• 대한수학회지
• /
• 제60권1호
• /
• pp.91-113
• /
• 2023

The polytope of tristochastic tensors of degree three, the Latin polytope, has two kinds of extreme points. Those that are at a maximum distance from the barycenter of the polytope correspond to Latin squares. The remaining extreme points are said to be short. The aim of the paper is to determine the geometry of these short extreme points, as they relate to the Latin squares. The paper adapts the Latin square notion of an intercalate to yield the new concept of a cross-intercalate between two Latin squares. Cross-intercalates of pairs of orthogonal Latin squares of degree three are used to produce the short extreme points of the degree three Latin polytope. The pairs of orthogonal Latin squares fall into two classes, described as parallel and reversed, each forming an orbit under the isotopy group. In the inverse direction, we show that each short extreme point of the Latin polytope determines four pairs of orthogonal Latin squares, two parallel and two reversed.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제6권
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• 대한수학회논문집
• /
• 제37권2호
• /
• pp.371-384
• /
• 2022

Fix an integer n ≥ 1. Then the simplex Π_n, Birkhoff polytope Ω_n, and Latin square polytope Λ_n each yield projective geometries obtained by identifying antipodal points on a sphere bounding a ball centered at the barycenter of the polytope. We investigate conditions for homogeneous coordinates of points in the projective geometries to locate exact vertices of the respective polytopes, namely crisp distributions, permutation matrices, and quasigroups or Latin squares respectively. In the latter case, the homogeneous conditions form a crucial part of a recent projective-geometrical approach to the study of orthogonality of Latin squares. Coordinates based on the barycenter of Ω_n are also suited to the analysis of generalized doubly stochastic matrices, observing that orthogonal matrices of this type form a subgroup of the orthogonal group.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.285-293
• /
• 2006

Let X be a n-set and let A = [aij] be a $n {\times} n$ matrix for which $aij {\subseteq} X$, for $1 {\le} i,\;j {\le} n$. A is called a generalized Latin square on X, if the following conditions is satisfied: $U^n_{i=1}\;aij = X = U^n_{j=1}\;aij$. In this paper, we prove that every generalized Latin square has an orthogonal mate and introduce a Hv-structure on a set of generalized Latin squares. Finally, we prove that every generalized Latin square of order n, has a transversal set.

• Korean Journal of Mathematics
• /
• 제9권2호
• /
• pp.129-131
• /
• 2001

Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.