• Journal of the Korean Mathematical Society
• /
• v.40 no.2
• /
• pp.179-193
• /
• 2003

The braid-permutation group is a group of welded braids which is the extension of Artin's braid groups by the symmetric groups. It is also described as a subgroup of the automorphism group of a free group. We also show that the plus-construction of the classifying space of the infinite braid-permutation group has the following two types of splittings BBP(equation omitted) B∑(equation omitted) $\times$ X, BBP(equation omitted) B $^{＋}$$\times$ Y＝S$^1$$\times$Y, where X, Y are some spaces.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.337-344
• /
• 1997

In this paper, we study the isomorphism problem of Cayley permutation graphs. We obtain a necessary and sufficient condition that two Cayley permutation graphs are isomrphic by a direction-preserving and color-preserving (positive/negative) natural isomorphism. The result says that if a graph G is the Cayley graph for a group $\Gamma$ then the number of direction-preserving and color-preserving positive natural isomorphism classes of Cayley permutation graphs of G is the number of double cosets of $\Gamma^\ell$ in $S_\Gamma$, where $S_\Gamma$ is the group of permutations on the elements of $\Gamma and \Gamma^\ell$ is the group of left translations by the elements of $\Gamma$. We obtain the number of the isomorphism classes by counting the double cosets.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.453-467
• /
• 1997

A transitive permutation representation of a group G is said to be multiplicity-free if all of its irreducible constituents are distinct. The character corresponding to the action is called the permutation character, given by $(1_H)^G$, where H is the stabilizer of a point. Multiplicity-free permutation characters are of interest in the study of centralizer algebras and distance-transitive graphs, and all finite simple groups are known to have such characters. In this article, we extend to the alternating groups the result of J. Saxl who determined the multiplicity-free permutation representations of the symmetric groups. We classify all subgroups H for which $(1_H)^An, n > 18$, is multiplicity-free.

• Honam Mathematical Journal
• /
• v.34 no.4
• /
• pp.483-494
• /
• 2012

The set of all polynomial permutations of $\mathbb{Z}_{p^r}$ forms a group. We investigate the structure of the group and some related groups, and completely determine the structure of the group of all polynomial permutations of $\mathbb{Z}_{p^2}$.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.25-38
• /
• 2005

Oriented 2-factorable graphs are reduced to bouquets by permutation voltage assignment in this paper. Introducing the concept of k-class index of a permutation group, various oriented 2-factorable graphs are enumerated in this paper.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• The Korean Journal of Applied Statistics
• /
• v.30 no.4
• /
• pp.567-578
• /
• 2017

Grouped multivariate data can be tested for differences between two or more groups using multivariate analysis of variance (MANOVA). However, this method cannot be used if several assumptions of MANOVA are violated. In this case, multidimensional scaling (MDS) and analysis of distance (AOD) can be applied to grouped dissimilarities based on the various distances. A permutation test is a non-parametric method that can also be used to test differences between groups. MDS is used to calculate the coordinates of observations from dissimilarities and AOD is useful for finding group structure using the coordinates. In particular, AOD is mathematically associated with MANOVA if using the Euclidean distance when computing dissimilarities. In this paper, we study the between and within group structure by applying MDS and AOD to the grouped dissimilarities. In addition, we propose a new test statistic using the group structure for the permutation test. Finally, we investigate the relationship between AOD and MANOVA from dissimilarities based on the Euclidean distance.

• Journal of the Korean Statistical Society
• /
• v.9 no.1
• /
• pp.1-12
• /
• 1980

A parallel flats faraction for the $3^n$ factorial experiment is symbolically written as $At = C(r\timesf)$ where $A(r\timesn)$ is of rank r. The A-matrix partitions the nonnegligible effects into $(3^{n-r}-1)/2+1$ alias sets. The $U_i$ effects in the i-th alias set are related pairwise by elements from $S_3$, the symmetric group on three symbols. For each alias set the f flats produce an $f \times u_i$ alias componet permutation matrices (ACPM) with elements from $S_3$. All the information concerning the relationships among levels of the effects is contained in the ACPM.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.733-746
• /
• 2023

Let (X, d) be a semimetric space. A permutation Φ of the set X is a combinatorial self similarity of (X, d) if there is a bijective function f : d(X × X) → d(X × X) such that d(x, y) = f(d(Φ(x), Φ(y))) for all x, y ∈ X. We describe the set of all semimetrics ρ on an arbitrary nonempty set Y for which every permutation of Y is a combinatorial self similarity of (Y, ρ).

• Communications of Mathematical Education
• /
• v.25 no.3
• /
• pp.607-627
• /
• 2011

The purpose of this study is to analyse teaching and learning effects of the structural-mapping used instruction and to find out the characteristics of problem solving process in permutation and combination. For this study, two classes of 11th grade students(67 students) were randomly selected from S high school in D city. One of them was assigned to the experimental group and the other to the control group, respectively. Four lectures of the structural-mapping used instruction were carried out in the experimental group and same amount of lectures of the text book oriented instruction were carried out in the control group. The research findings are as follows. First, the structural-mapping used instruction is shown to be more effective in achievement than the traditional textbook-oriented instruction. Second, the ball-box model is found out to be easier and simpler than the selection-distribution model. Third, students who used the ball-box model are properly able to use both model.