• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.445-459
• /
• 1998

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set $\Gamma$$_{λ}$(X) of pairs (equation omitted) satisfying a certain condition and the set $\pi_{λ}$(X) of circled permutation tableaux of shape λ on the set X, where P$\frac{1}{2}$ is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: $\Sigma$2$\ell$(type($\sigma$)) = 2n! summed over all permutation $\sigma$ $\in$ $S_{n}$ with type($\sigma$) $\in$ O $P_{n}$ . .

• Communications for Statistical Applications and Methods
• /
• v.22 no.3
• /
• pp.285-294
• /
• 2015

A permutation test is the popular and attractive alternative to derive asymptotic distributions of dimension test statistics in sufficient dimension reduction methodologies; however, recent studies show that a bootstrapping technique also can be used. We consider two types of bootstrapping dimension determination, which are partial and whole bootstrapping procedures. Numerical studies compare the permutation test and the two bootstrapping procedures; subsequently, real data application is presented. Considering two additional bootstrapping procedures to the existing permutation test, one has more supporting evidence for the dimension estimation of the central subspace that allow it to be determined more convincingly.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.137-145
• /
• 2001

There are many situations in which the well-known tests such as log-rank test and Gehan-Wilcoxon test fail to detect the survival differences. Assuming large samples, these tests are developed asymptotically normal properties. Thus, they shall be called asymptotic tests in this paper, Several asymptotic tests sensitive to some specific types of survival differences have been recently proposed. This paper compares by simulations the test levels and the powers of the conventional asymptotic tests and their random permutation versions. Simulation studies show that the random permutation tests possess competitive powers compared to the corresponding asymptotic tests, keeping exact test levels even in the small sample case. It also provides the guidelines for choosing the valid and most powerful test under the given situation.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• 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 Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.117-124
• /
• 2012

In this paper, we propose a simple H parity check matrix from the CPM(circulant permutation matrix), which can easily avoid the cycle-4, and approach to flexible code rates and lengths. As a result, the operations of the submatrices will become the multiplications between several CPMs, the calculations of the LDPC(low density parity check) encoding could be simplest. Also we consider the fast encoding problem for LDPC codes. The proposed constructions could lead to fast encoding based on the simplest matrices operations for both regular and irregular LDPC codes.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.679-684
• /
• 2005

In this paper, we characterize a permutation property of a certain type of binomials over the field through the use of Hermite's criterion.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1059-1072
• /
• 2009

In the analysis of microarray data with a small number of arrays, the most important task is the detection of differentially expressed genes by a significance test. For this purpose, one needs to construct a null distribution based on a large number of genes and one of the best way for constructing the null distribution for a small number of arrays is by means of permutation methods. In this paper we propose simple test statistics and permutation methods that are appropriate in constructing the null distribution. In a simulation study, we compare the null distributions generated by the proposed test statistics and permutation methods with the previous ones. With an example microarray data, differentially expressed genes are determined by applying these methods.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.257-268
• /
• 2004

In this paper, we give a proof of the Robinson-Schensted-Knuth correspondence by using the geometric. construction. We represent a generalized permutation in the first quadrant of the Cartesian plane and find a corresponding pair of semi-standard tableaux of same shape. This work extends the classical geometric construction of Viennot [10] for Robinson-Schensted correspondence.

• Journal of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.921-948
• /
• 2021

We continue the investigations in [6] extending the Bruhat order on n × n alternating sign matrices to our more general setting. We show that the resulting partially ordered set is a graded lattice with a well-define rank function. Many illustrative examples are given.