• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.917-923
• /
• 2000

In this paper, we obtain the number of the minimal generalized permutations on a finite set. Also, we determine the minimal generalized permutations on a set X of cardinality less than or equal to 4.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.529-541
• /
• 2013

We study 132 avoiding permutations that also avoid $(2r+1)(2r+2){\cdots}12$ but contain $(2r-1)(2r){\cdots}12$ pattern. We find an identity between the number of these permutations and the Narayana number. We also present relations between 132 avoiding permutations and polygon dissections. Finally, a generalization of these permutations is obtained.

• Honam Mathematical Journal
• /
• v.29 no.4
• /
• pp.495-509
• /
• 2007

In this note it is proved that MPR is rigid as a Hopf algebra with distinguished basis. I.e. there are no nontrivial automorphisms that preserve the multiplication and comultiplication and take the distinguished basis of all permutations into itself (as a graded set).

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.793-806
• /
• 2001

In this paper we consider the enumeration problem of permutations with partially forbidden positions, generalizing the notion of permutations with forbidden positions. .As an alternative approach to this problem, we investigate the permanent maximization problem over some classes of (0,1)-matrices which have a given number of 1's some of which lie in prescribed positions.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1149-1161
• /
• 2017

An ($n_1,\;n_2,\;{\ldots},\;n_k$)-colored permutation is a permutation of $n_1+n_2+{\cdots}+n_k$ in which $1,\;2,\;{\ldots},\;n_1$ have color 1, and $n_1+1,\;n_1+2,\;{\ldots},\;n_1+n_2$ have color 2, and so on. We give a bijective proof of Steinhardt's result: the number of colored permutations with no monochromatic cycles is equal to the number of permutations with no fixed points after reordering the first $n_1$ elements, the next $n_2$ element, and so on, in ascending order. We then find the generating function for colored permutations with no monochromatic cycles. As an application we give a new proof of the well known generating function for colored permutations with no fixed colors, also known as multi-derangements.

• 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.18 no.1_2
• /
• pp.657-663
• /
• 2005

In this paper, we consider groups of permutations S on a set A acting on subsets X of A. In particular, we show that if $X_2{\subseteq}X_1{\subseteq}A$ and Y is an S-normal extension of $X_2 in X_1$, then the Galois group $G_{S}(X_1/Y){\;}of{\;}X_1{\;}over{\;}X_2$ relative to S is an S-closed subgroup of $G_{S}(X_1/X_2)$ in the setting of a Galois theory (correspondence) for this situation.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.253-257
• /
• 2021

In this paper, we provide a recursive formula for the number of involutions of doubly alternating Baxter permutations in S_n.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.553-561
• /
• 2006

In this paper, we give an alternative proof that the number of doubly alternating Baxter permutations is Catalan.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.4
• /
• pp.97-106
• /
• 1996

In this paper, we define an equivalence relation on the group of all permutations over the finite field GF($2^n$) and show each equivalence class has common cryptographic properties. And, we classify all exponent permutations over GF($2^7$) and GF($2^8$). Then, three applications of our results are described. We suggest a method for designing $n\;{\times}\;2n$ S(ubstitution)-boxes by the concatenation of two exponent permutations over GF($2^n$) and study the differential and linear resistance of them. And we can easily indicate that the conjecture of Beth in Eurocrypt '93 is wrong, and discuss the security of S-box in LOKI encryption algorithm.