• Journal for History of Mathematics
• /
• v.13 no.2
• /
• pp.33-40
• /
• 2000

This paper deals with the development of early group theory. We first investigate how the concept of abstract groups has emerged as a generalization of groups of substitution(=permutation groups) which strongly relate the theory of equations.

• The Korean Journal of Applied Statistics
• /
• v.25 no.2
• /
• pp.269-277
• /
• 2012

In microarray data analysis, recent efforts have focused on the discovery of gene sets from a pathway or functional categories such as Gene Ontology terms(GO terms) rather than on individual gene function for its direct interpretation of genome-wide expression data. We introduce a meta-analysis method that combines $p$-values for changes of each gene in the group. The method measures the significance of overall treatment-induced change in a gene group. An application of the method to a real data demonstrates that it has benefits over other statistical methods such as Fisher's exact test and permutation methods. The method is implemented in a SAS program and it is available on the author's homepage(http://cafe.daum.net/go.analysis).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.75-85
• /
• 2010

This paper presents a robust 3D model hashing based on object feature vector for 3D content authentication. The proposed 3D model hashing selects the feature objects with highest area in a 3D model with various objects and groups the distances of the normalized vertices in the feature objects. Then we permute groups in each objects by using a permutation key and generate the final binary hash through the binary process with the group coefficients and a random key. Therefore, the hash robustness can be improved by the group coefficient from the distance distribution of vertices in each object group and th hash uniqueness can be improved by the binary process with a permutation key and a random key. From experimental results, we verified that the proposed hashing has both the robustness against various mesh and geometric editing and the uniqueness.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.193-202
• /
• 1994

In this paper, we investigate possible scrambling methods for the JPEG(Joint Photographic Export Group) still image compression standard. In particular, we compare the conventional line rotation and line permutation methods to the DCT block scrambling in terms of the number of bits to be increased and the easiness of buffer control. Computer simulation results show that the DCT block scrambling method is suitable for both data security and buffer control in one-chip JPEG applications.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.75-96
• /
• 2006

Let m, n be positive integers. We denote by R(m,n) (respectively P(m,n)) the class of all groups G such that, for every n subsets $X_1,X_2\ldots,X_n$, of size m of G there exits a non-identity permutation $\sigma$ such that $X_1X_2{\cdots}X_n{\cap}X_{\sigma(1)}X_{/sigma(2)}{\cdots}X_{/sigma(n)}\neq\phi$ (respectively $X_1X_2{\cdots}X_n=X_{/sigma(1)}X_{\sigma(2)}{\cdots}X_{\sigma(n)}$). Let G be a non-abelian group. In this paper we prove that (i) $G{\in}P$(2,3) if and only if G isomorphic to $S_3$, where $S_n$ is the symmetric group on n letters. (ii) $G{\in}R$(2, 2) if and only if ${\mid}G{\mid}\geq8$. (iii) If G is finite, then $G{\in}R$(3, 2) if and only if ${\mid}G{\mid}\geq14$ or G is isomorphic to one of the following: SmallGroup(16, i), $i\in$ {3, 4, 6, 11, 12, 13}, SmallGroup(32, 49), SmallGroup(32, 50), where SmallGroup(m, n) is the nth group of order m in the GAP [13] library.

• Genomics & Informatics
• /
• v.14 no.4
• /
• pp.187-195
• /
• 2016

In genetic association studies with high-dimensional genomic data, multiple group testing procedures are often required in order to identify disease/trait-related genes or genetic regions, where multiple genetic sites or variants are located within the same gene or genetic region. However, statistical testing procedures based on an individual test suffer from multiple testing issues such as the control of family-wise error rate and dependent tests. Moreover, detecting only a few of genes associated with a phenotype outcome among tens of thousands of genes is of main interest in genetic association studies. In this reason regularization procedures, where a phenotype outcome regresses on all genomic markers and then regression coefficients are estimated based on a penalized likelihood, have been considered as a good alternative approach to analysis of high-dimensional genomic data. But, selection performance of regularization procedures has been rarely compared with that of statistical group testing procedures. In this article, we performed extensive simulation studies where commonly used group testing procedures such as principal component analysis, Hotelling's $T^2$ test, and permutation test are compared with group lasso (least absolute selection and shrinkage operator) in terms of true positive selection. Also, we applied all methods considered in simulation studies to identify genes associated with ovarian cancer from over 20,000 genetic sites generated from Illumina Infinium HumanMethylation27K Beadchip. We found a big discrepancy of selected genes between multiple group testing procedures and group lasso.

• Journal for History of Mathematics
• /
• v.19 no.2
• /
• pp.125-140
• /
• 2006

In 1933, I. Schur introduced a Schur ring in connection with permutation group and regular subgroup. After then, it was studied mostly for purely group theoretical purposes. In 1970s, Klin and Poschel initiated its usage in the investigation of graphs, especially for Cayley and circulant graphs. Nowadays it is known that Schur ring is one of the best way to enumerate Cayley graphs. In this paper we study the origin of Schur ring back to 1933 and keep trace its evolution to graph theory and combinatorics.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-27
• /
• 2010

A Cayley map is a 2-cell embedding of a Cayley graph into an orientable surface with the same local orientation induced by a cyclic permutation of generators at each vertex. In this paper, we provide classifications of prime-valent regular Cayley maps on abelian groups, dihedral groups and dicyclic groups. Consequently, we show that all prime-valent regular Cayley maps on dihedral groups are balanced and all prime-valent regular Cayley maps on abelian groups are either balanced or anti-balanced. Furthermore, we prove that there is no prime-valent regular Cayley map on any dicyclic group.

• Communications of the Korean Mathematical Society
• /
• v.37 no.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.

• Communications of Mathematical Education
• /
• v.5
• /
• pp.523-523
• /
• 1997

Suppose that G is a group of permutations of a set ${\Omega}$. For a finite subset ${\gamma}$of${\Omega}$, the movement of ${\gamma}$ under the action of G is defined as move(${\gamma}$):=$max\limits_{g{\epsilon}G}|{\Gamma}^{g}{\backslash}{\Gamma}|$, and ${\gamma}$ will be said to have restricted movement if move(${\gamma}$)<|${\gamma}$|. Moreover if, for an infinite subset ${\gamma}$of${\Omega}$, the sets|{\Gamma}^{g}{\backslash}{\Gamma}| are finite and bounded as g runs over all elements of G, then we may define move(${\gamma}$)in the same way as for finite subsets. If move(${\gamma}$)${\leq}$m for all ${\gamma}$${\subseteq}$${\Omega}$, then G is said to have bounded movement and the movement of G move(G) is defined as the maximum of move(${\gamma}$) over all subsets ${\gamma}$ of ${\Omega}$. Having bounded movement is a very strong restriction on a group, but it is natural to ask just which permutation groups have bounded movement m. If move(G)=m then clearly we may assume that G has no fixed points is${\Omega}$, and with this assumption it was shown in [4, Theorem 1]that the number t of G=orbits is at most 2m-1, each G-orbit has length at most 3m, and moreover|${\Omega}$|${\leq}$3m+t-1${\leq}$5m-2. Moreover it has recently been shown by P. S. Kim, J. R. Cho and C. E. Praeger in [1] that essentially the only examples with as many as 2m-1 orbits are elementary abelian 2-groups, and by A. Gardiner, A. Mann and C. E. Praeger in [2,3]that essentially the only transitive examples in a set of maximal size, namely 3m, are groups of exponent 3. (The only exceptions to these general statements occur for small values of m and are known explicitly.) Motivated by these results, we would decide what role if any is played by primes other that 2 and 3 for describing the structure of groups of bounded movement.