{\rtf1{\fonttbl

{\f2 Arial;}
{\f3 Arial;}
{\f4 Arial;}
{\f5 Arial;}
{\f6 Arial;}
{\f7 Arial;}
{\f1000000 Times New Roman;}
}{\colortbl;
\red0\green0\blue0;
\red0\green0\blue0;
\red0\green0\blue0;
\red0\green0\blue0;
\red0\green0\blue0;
\red0\green0\blue0;
}\viewkind1\viewscale100\margl0\margr0\margt0\margb0\deftab80\dntblnsbdb\expshrt
n\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart Pg1}{\bkmkend Pg1}\par\pard
\ql \li2104\sb0\sl-391\slmult0 \par\pard\ql\li2104\sb0\sl-391\slmult0 \par\pard\
ql\li2104\sb0\sl-391\slmult0 \par\pard\ql\li2104\sb104\sl-391\slmult0 \up0 \expn
dtw0\charscalex88 \ul0\nosupersub\cf1\f2\fs34 Week 4-5: Generating Permutations
and Combinations \par\pard\ql \li5117\sb0\sl-276\slmult0 \par\pard\ql\li5117\sb0
\sl-276\slmult0 \par\pard\ql\li5117\sb0\sl-276\slmult0 \par\pard\ql\li5117\sb216
\sl-276\slmult0 \up0 \expndtw-8\charscalex100 \ul0\nosupersub\cf2\f3\fs24 March
10, 2014 \par\pard\ql \li432\sb0\sl-333\slmult0 \par\pard\ql\li432\sb0\sl-333\sl
mult0 \par\pard\ql\li432\sb51\sl-333\slmult0\tx916 \up0 \expndtw0\charscalex98 \
ul0\nosupersub\cf3\f4\fs29 1 \tab \up0 \expndtw0\charscalex109 Generating Permut
ations \par\pard\qj \li432\ri261\sb285\sl-360\slmult0 \up0 \expndtw0\charscalex9
7 We have learned that there are n! permutations of \{1, 2, . . . , n\}. It is i
mportant in many \line \up0 \expndtw0\charscalex96 instances to generate a list
of such permutations. For example, for the permutation 3142 \line \up0 \expndtw0
\charscalex97 of \{1, 2, 3, 4\}, we may insert 5 in 3142 to generate five permut
ations of \{1, 2, 3, 4, 5\} as \line \up0 \expndtw0\charscalex97 follows: \par\p
ard\li3363\sb22\sl-333\slmult0\fi0\tx4438\tx5513\tx6589\tx7664 \up0 \expndtw0\ch
arscalex86 53142,\tab \up0 \expndtw0\charscalex86 35142,\tab \up0 \expndtw0\char
scalex86 31542,\tab \up0 \expndtw0\charscalex86 31452,\tab \up0 \expndtw0\charsc
alex86 31425.\par\pard\qj \li432\ri261\sb126\sl-360\slmult0 \up0 \expndtw0\chars
calex100 If we have a complete list of permutations for \{1, 2, . . . , n \u8722
? 1\}, then we can obtain a \up0 \expndtw0\charscalex94 complete list of permuta
tions for \{1, 2, . . . , n\} by inserting n in n ways to each permutation \up0
\expndtw0\charscalex94 of the list for \{1, 2, . . . , n \u8722? 1\}. \par\pard\
ql \li770\sb23\sl-333\slmult0 \up0 \expndtw0\charscalex100 For n = 1, the list i
s just \par\pard\ql \li5833\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex85 1 \p
ar\pard\ql \li770\sb148\sl-333\slmult0 \up0 \expndtw0\charscalex100 For n = 2, t
he list is\par\pard\sect\sectd\sbknone\cols3\colno1\colw5705\colsr160\colno2\col
w735\colsr160\colno3\colw5010\colsr160\ql \li4938\sb9\sl-326\slmult0\tx5273 \up0
\expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex98 2\par\pard\ql \li4577\
sb28\sl-333\slmult0 \up0 \expndtw0\charscalex102 2 1\par\pard\ql \li770\sb124\s
l-333\slmult0 \up0 \expndtw0\charscalex100 For n = 3, the list is\par\pard\ql \l
i4418\sb0\sl-326\slmult0\tx5113\tx5453 \up0 \expndtw0\charscalex85 1\tab \up0 \e
xpndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex98 3\par\pard\ql \li4418\sb2
8\sl-333\slmult0\tx4753 \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charsca
lex102 3 2\par\pard\ql \li4057\sb26\sl-333\slmult0\tx5113 \up0 \expndtw0\charsc
alex102 3 1\tab \up0 \expndtw0\charscalex85 2\par\pard\ql \li4057\sb27\sl-333\s
lmult0\tx5113 \up0 \expndtw0\charscalex102 3 2\tab \up0 \expndtw0\charscalex85
1\par\pard\ql \li4418\sb27\sl-333\slmult0\tx4753 \up0 \expndtw0\charscalex85 2\t
ab \up0 \expndtw0\charscalex102 3 1\par\pard\ql \li4418\sb26\sl-333\slmult0\tx5
113\tx5453 \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \
up0 \expndtw0\charscalex98 3\par\pard\column \ql \li20\sb184\sl-333\slmult0 \up0
\expndtw0\charscalex117 =\u8658?\par\pard\ql \li6046\sb0\sl-333\slmult0 \par\pa
rd\ql \li6046\sb0\sl-333\slmult0 \par\pard\ql \li6046\sb0\sl-333\slmult0 \par\pa

rd\ql \li6046\sb0\sl-333\slmult0 \par\pard\ql \li201\sb195\sl-333\slmult0 \up0 \

expndtw0\charscalex117 =\u8658?\par\pard\column \ql \li20\sb4\sl-333\slmult0\tx3
64 \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\par\pard\ql \
li20\sb27\sl-333\slmult0\tx364 \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\
charscalex85 1\par\pard\ql \li6930\sb0\sl-333\slmult0 \par\pard\ql \li200\sb118\
sl-333\slmult0\tx545\tx884 \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\char
scalex85 2\tab \up0 \expndtw0\charscalex85 3\par\pard\ql \li200\sb27\sl-333\slmu
lt0\tx545\tx884 \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\
tab \up0 \expndtw0\charscalex85 2\par\pard\ql \li200\sb26\sl-333\slmult0\tx545\t
x884 \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \e
xpndtw0\charscalex85 2\par\pard\ql \li200\sb27\sl-333\slmult0\tx545\tx884 \up0 \
expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\cha
rscalex85 1\par\pard\ql \li200\sb27\sl-333\slmult0\tx545\tx884 \up0 \expndtw0\ch
arscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1
\par\pard\ql \li200\sb26\sl-333\slmult0\tx545\tx884 \up0 \expndtw0\charscalex85
2\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3 \par\pard\
sect\sectd\sbknone \li432\sb141\sl-333\slmult0\fi338 \up0 \expndtw0\charscalex96
To generate a complete list of permutations for the set \{1, 2, . . . , n\}, we
assign a direc-\par\pard\sect\sectd\sbknone \li432\sb26\sl-333\slmult0\fi0 \up0
\expndtw0\charscalex96 tion to each integer k \u8712? \{1, 2, . . . , n\} by wr
iting an arrow above it pointing to the left or\par\pard\sect\sectd\sbknone \li4
32\sb27\sl-333\slmult0\fi0 \up0 \expndtw0\charscalex95 to the right:\par\pard\li
5179\sb0\sl-180\slmult0\fi0\tx6281 \up0 \expndtw0\charscalex108 \ul0\nosupersub\
cf4\f5\fs20 \u8592?\tab \up0 \expndtw0\charscalex108 \u8594?\par\pard\li5179\sb0
\sl-261\slmult0\fi16\tx6298 \up0 \expndtw0\charscalex108 \ul0\nosupersub\cf3\f4\
fs29 k or\tab \up0 \expndtw0\charscalex108 k .\par\pard\qj \li432\ri261\sb85\s
l-360\slmult0 \up0 \expndtw0\charscalex94 We consider permutations of \{1, 2, .
. . , n\} in which each integer is given a direction; such \line \up0 \expndtw0\
charscalex100 permutations are called directed permutations. An integer k in a d
irected permutation \line \up0 \expndtw0\charscalex100 is called mobile if its a
rrow points to a smaller integer adjacent to it. For example, for \par\pard\ql
\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\l
i5849\sb83\sl-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\f
s22 1 \par\pard\sect\sectd\fs24\paperw11900\paperh16820
{\shp {\*\shpinst\shpleft292\shptop1672\shpright8024\shpbottom2262\shpfhdr0\shpb
xpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl210 \li0\ri0 \expndtw-5\charscale
x100\ul0\nosupersub\cf3\f4\fs29 integer and its arrow points to the right, i.e.,
\ul0\super\cf4\f5\fs29 \u8594?{\par}}}}
{\shp {\*\shpinst\shpleft630\shptop12019\shpright4859\shpbottom12640\shpfhdr0\sh
pbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl205 \li0\ri0 \expndtw-1\charscale
x100\ul0\nosupersub\cf3\f4\fs29 Step 0. Begin with\ul0\super\cf4\f5\fs29 \u8592
?{\par}}}}
{\shp {\*\shpinst\shpleft3292\shptop12050\shpright5562\shpbottom12661\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl197 \li0\ri0 \expndtw-11\charscal
ex96\ul0\nosupersub\cf3\f4\fs29 2 \ul0\super\cf4\f5\fs29 \u8592?{\par}}}}\pard\s

b0\sl-240{\bkmkstart Pg2}{\bkmkend Pg2}\par\pard\li432\sb0\sl-230\slmult0\par\pa

rd\li432\sb73\sl-230\slmult0\fi0 \up0 \expndtw-5\charscalex100 \ul0\nosupersub\c
f4\f5\fs20 \u8594?\t \up0 \expndtw-5\charscalex100 \u8594?\t \up0 \expndtw-5\cha
rscalex100 \u8592?\t \up0 \expndtw-5\charscalex100 \u8594?\t \up0 \expndtw-5\cha
rscalex100 \u8594?\t \up0 \expndtw-5\charscalex100 \u8594?\par\pard\li432\sb0\sl
-261\slmult0\fi29\tx660\tx859\tx1059\tx1258\tx1457 \up0 \expndtw0\charscalex82 \
ul0\nosupersub\cf3\f4\fs29 3\tab \up0 \expndtw0\charscalex82 2\tab \up0 \expndtw
0\charscalex82 5\tab \up0 \expndtw0\charscalex82 4\tab \up0 \expndtw0\charscalex
82 6\tab \up0 \expndtw0\charscalex95 1 , the integers 3, 5, and 6 are mobile. It
follows that 1 can never be mobile since\par\pard\ql \li432\sb20\sl-299\slmult0
\up0 \expndtw0\charscalex99 there is no integer in \{1, 2, . . . , n\} smaller
than 1. The integer n is mobile, except two \par\pard\ql \li8623\sb0\sl-180\slm
ult0 \up0 \expndtw-2\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\par\pard\
sect\sectd\sbknone\cols2\colno1\colw8579\colsr60\colno2\colw3121\colsr160\ql \li
432\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex98 \ul0\nosupersub\cf3\f4\fs29 c
ases: (i) n is the first integer and its arrow points to the left, i.e.,\par\par
d\ql \li6476\sb16\sl-333\slmult0 \up0 \expndtw0\charscalex106 n.\par\pard\ql \li
770\sb274\sl-333\slmult0 \up0 \expndtw0\charscalex103 For n = \up0 \expndtw0\cha
rscalex94 4, we have the list\par\pard\ql \li3898\sb214\sl-333\slmult0\tx4593\tx
5294\tx5633\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex85 1\tab \up0 \
expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\cha
rscalex98 4\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\
tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 4\par\pard\ql
\li3898\sb27\sl-333\slmult0\tx4593\tx4933\tx5294\tx7105\tx7445\tx7785\tx8125 \up
0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\
charscalex98 4\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85
1\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 4\tab \up0
\expndtw0\charscalex85 3\par\pard\ql \li3898\sb26\sl-333\slmult0\tx4233\tx4593\t
x5294\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex85 1\tab \up0 \expndt
w0\charscalex98 4\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscale
x85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 4\tab \u
p0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\par\pard\ql \li353
7\sb27\sl-333\slmult0\tx3893\tx4593\tx5294\tx7105\tx7445\tx7785\tx8125 \up0 \exp
ndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charsc
alex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 4\tab
\up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expnd
tw0\charscalex85 3\par\pard\ql \li3537\sb27\sl-333\slmult0\tx3893\tx4593\tx5294\
tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\cha
rscalex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\
tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 1\tab \up0 \ex
pndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\par\pard\ql \li3898\sb26
\sl-333\slmult0\tx4233\tx4593\tx5294\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\
charscalex85 1\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85
3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0
\expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\ch
arscalex85 2\par\pard\ql \li3898\sb27\sl-333\slmult0\tx4593\tx4933\tx5294\tx7105
\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscale
x85 3\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 2\tab \u
p0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0
\charscalex85 4\tab \up0 \expndtw0\charscalex85 2\par\pard\ql \li3898\sb27\sl-33
3\slmult0\tx4593\tx5294\tx5633\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charsc
alex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\tab
\up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expnd
tw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscal
ex85 4\par\pard\ql \li3898\sb26\sl-333\slmult0\tx4593\tx5294\tx5633\tx7105\tx744
5\tx7785\tx8125 \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1\
tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex98 4\tab \up0 \ex
pndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\chars
calex85 2\tab \up0 \expndtw0\charscalex85 4\par\pard\ql \li3898\sb27\sl-333\slmu
lt0\tx4593\tx4933\tx5294\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex85

3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex98 4\tab \up0

\expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\ch
arscalex85 1\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 2
\par\pard\ql \li3898\sb27\sl-333\slmult0\tx4233\tx4593\tx5294\tx7105\tx7445\tx77
85\tx8125 \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex98 4\tab \u
p0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0
\charscalex85 3\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex8
5 1\tab \up0 \expndtw0\charscalex85 2\par\pard\ql \li3537\sb26\sl-333\slmult0\tx
3893\tx4593\tx5294\tx7105\tx7445\tx7785\tx8125 \up0 \expndtw0\charscalex98 4\tab
\up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expnd
tw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscal
ex85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\par\p
ard\column \ql \li20\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex96 n ; (ii) n i
s the last\par\pard\sect\sectd\sbknone\cols2\colno1\colw3788\colsr110\colno2\col
w7862\colsr160\ql \li3537\sb39\sl-333\slmult0 \up0 \expndtw0\charscalex98 4\par\
pard\ql \li432\sb0\sl-333\slmult0 \par\pard\ql \li432\sb0\sl-333\slmult0 \par\pa
rd\ql \li432\sb0\sl-333\slmult0 \par\pard\ql \li432\sb0\sl-333\slmult0 \par\pard
\ql \li432\sb0\sl-333\slmult0 \par\pard\ql \li432\sb0\sl-333\slmult0 \par\pard\q
l \li3537\sb180\sl-333\slmult0 \up0 \expndtw0\charscalex98 4\par\pard\ql \li3537
\sb27\sl-333\slmult0 \up0 \expndtw0\charscalex98 4\par\pard\column \ql \li2348\s
b0\sl-261\slmult0 \up0 \expndtw0\charscalex117 =\u8658?\par\pard\ql \li20\sb0\sl
-261\slmult0\tx725\tx1426\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw0\charscalex8
5 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0
\expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\c
harscalex85 2\tab \up0 \expndtw0\charscalex85 1\par\pard\ql \li20\sb0\sl-261\slm
ult0\tx365\tx725\tx1426\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw0\charscalex85
3\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 2\tab \up0 \
expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\cha
rscalex85 4\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\
par\pard\ql \li20\sb1\sl-300\slmult0\tx725\tx1065\tx1426\tx3237\tx3577\tx3917\tx
4257 \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \e
xpndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\char
scalex85 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 4\t
ab \up0 \expndtw0\charscalex85 1\par\pard\ql \li20\sb32\sl-333\slmult0\tx725\tx1
426\tx1765\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw0\charscalex85 3\tab \up0 \e
xpndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\char
scalex98 4\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 2\t
ab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 4\par\pard\ql \
li20\sb27\sl-333\slmult0\tx725\tx1426\tx1765\tx3237\tx3577\tx3917\tx4257 \up0 \e
xpndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\char
scalex85 1\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 2\t
ab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1\tab \up0 \exp
ndtw0\charscalex85 4\par\pard\ql \li20\sb26\sl-333\slmult0\tx725\tx1065\tx1426\t
x3237\tx3577\tx3917\tx4257 \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\char
scalex85 3\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 1\t
ab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \exp
ndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 1\par\pard\ql \li20\sb27\sl
-333\slmult0\tx365\tx725\tx1426\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw0\chars
calex85 2\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 3\ta
b \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expn
dtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charsca
lex85 1\par\pard\ql \li20\sb26\sl-333\slmult0\tx725\tx1426\tx3237\tx3577\tx3917\
tx4257 \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0
\expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\ch
arscalex85 2\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex85 1
\par\pard\ql \li20\sb27\sl-333\slmult0\tx725\tx1426\tx3237\tx3577\tx3917\tx4257
\up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndt
w0\charscalex85 3\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscale
x85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\par\pa
rd\ql \li20\sb27\sl-333\slmult0\tx365\tx725\tx1426\tx3237\tx3577\tx3917\tx4257 \

up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw

0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\charscalex
85 2\tab \up0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 1\tab \up
0 \expndtw0\charscalex85 3\par\pard\ql \li20\sb26\sl-333\slmult0\tx725\tx1065\tx
1426\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw
0\charscalex85 1\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex
85 3\tab \up0 \expndtw0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up
0 \expndtw0\charscalex85 4\tab \up0 \expndtw0\charscalex85 3\par\pard\ql \li20\s
b27\sl-333\slmult0\tx725\tx1426\tx1765\tx3237\tx3577\tx3917\tx4257 \up0 \expndtw
0\charscalex85 2\tab \up0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex
85 3\tab \up0 \expndtw0\charscalex98 4\tab \up0 \expndtw0\charscalex85 2\tab \up
0 \expndtw0\charscalex85 1\tab \up0 \expndtw0\charscalex85 3\tab \up0 \expndtw0\
charscalex85 4 \par\pard\sect\sectd\sbknone \li432\sb230\sl-333\slmult0\fi0\tx19
91 \up0 \expndtw0\charscalex99 Algorithm\tab \up0 \expndtw0\charscalex99 1.1. Al
gorithm for Generating Permutations of \{1, 2, . . . , n\}:\par\pard\ql \li3402\
sb0\sl-180\slmult0 \up0 \expndtw-2\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8
592? \par\pard\li3232\sb0\sl-261\slmult0\fi0\tx4111 \dn2 \expndtw0\charscalex98
\ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charscalex98 n.\par\pard\ql \li
770\sb19\sl-290\slmult0 \up0 \expndtw0\charscalex96 Step 1. Find the largest mob
ile integer m. \par\pard\qj \li770\ri3179\sb13\sl-360\slmult0 \up0 \expndtw0\cha
rscalex97 Step 2. Switch m and the adjacent integer its arrow points to. \up0 \e
xpndtw0\charscalex98 Step 3. Switch the directions for all integers p > m. \par\
pard\qj \li770\ri1206\sb0\sl-360\slmult0\tx1771 \up0 \expndtw0\charscalex102 Ste
p 4. Write down the resulting permutation with directions and return to \line\ta
b \up0 \expndtw0\charscalex91 Step 1. \par\pard\ql \li770\sb1\sl-263\slmult0 \up
0 \expndtw0\charscalex96 Step 5. Stop if there is no mobile integer. \par\pard\q
l \li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql
\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb87\sl-253\slmult0 \up0 \expndtw
-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 2 \par\pard\sect\sectd\fs24\paperw1
1900\paperh16820
{\shp {\*\shpinst\shpleft630\shptop514\shpright6341\shpbottom1135\shpfhdr0\shpbx
page\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl208 \li0\ri0 \expndtw-5\charscale
x100\ul0\nosupersub\cf3\f4\fs29 For example, for n = 2, we have\ul0\super\cf4\f5
\fs29 \u8592?{\par}}}}
{\shp {\*\shpinst\shpleft4889\shptop514\shpright7385\shpbottom1156\shpfhdr0\shpb
xpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl193 \li0\ri0 \expndtw0\charscalex
101\ul0\nosupersub\cf3\f4\fs29 2 and\ul0\super\cf4\f5\fs29 \u8592?{\par}}}}
{\shp {\*\shpinst\shpleft6183\shptop6044\shpright8170\shpbottom6634\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl193 \li0\ri0 \expndtw-11\charscal
ex92\ul0\nosupersub\cf3\f4\fs29 \ul0\super\cf4\f5\fs29 \u8594?{\par}}}}
{\shp {\*\shpinst\shpleft6104\shptop7735\shpright8091\shpbottom8325\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL

ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe

hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl193 \li0\ri0 \expndtw-11\charscal
ex92\ul0\nosupersub\cf3\f4\fs29 \ul0\super\cf4\f5\fs29 \u8592?{\par}}}}\pard\sb0
\sl-240{\bkmkstart Pg3}{\bkmkend Pg3}\par\pard\li432\sb0\sl-230\slmult0\par\pard
\li432\sb73\sl-230\slmult0\fi4568\tx6038 \up0 \expndtw-5\charscalex100 \ul0\nosu
persub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\par\pard\li
432\sb0\sl-261\slmult0\fi4398\tx5868\tx6067 \up0 \expndtw0\charscalex94 \ul0\nos
upersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charscalex82 2\tab \up0 \expndtw0\chars
calex94 1 . For n = 3, we have\par\pard\li432\sb38\sl-230\slmult0\fi2189\tx2900\
tx3179\tx3751\tx4030\tx4309\tx4881\tx5160\tx5439\tx6011\tx6290\tx6569\tx7141\tx7
420\tx7699\tx8271\tx8550\tx8829 \up0 \expndtw-5\charscalex100 \ul0\nosupersub\cf
4\f5\fs20 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\
charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndt
w-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \ex
pndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0
\expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8594?\tab
\up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\
tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u85
94?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100
\u8592?\tab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex
100 \u8594?\par\pard\li432\sb0\sl-261\slmult0\fi2218\tx2929\tx3198\tx3780\tx4049
\tx4338\tx4910\tx5189\tx5458\tx6030\tx6319\tx6598\tx7171\tx7439\tx7729\tx8301\tx
8580\tx8859 \up0 \expndtw0\charscalex94 \ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \
expndtw0\charscalex94 2\tab \up0 \expndtw0\charscalex94 3,\tab \up0 \expndtw0\ch
arscalex94 1\tab \up0 \expndtw0\charscalex94 3\tab \up0 \expndtw0\charscalex94 2
,\tab \up0 \expndtw0\charscalex94 3\tab \up0 \expndtw0\charscalex94 1\tab \up0
\expndtw0\charscalex94 2,\tab \up0 \expndtw0\charscalex94 3\tab \up0 \expndtw0\c
harscalex94 2\tab \up0 \expndtw0\charscalex94 1 ,\tab \up0 \expndtw0\charscalex9
4 2\tab \up0 \expndtw0\charscalex94 3\tab \up0 \expndtw0\charscalex94 1 ,\tab \u
p0 \expndtw0\charscalex94 2\tab \up0 \expndtw0\charscalex94 1\tab \up0 \expndtw0
\charscalex94 3 .\par\pard\li432\sb133\sl-333\slmult0\fi0 \up0 \expndtw0\charsca
lex94 For n = 4, the algorithm produces the list\par\pard\li3118\sb59\sl-230\slm
ult0\fi0\tx3516\tx3915\tx4313\tx5206\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\t
x8490 \up0 \expndtw-6\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\tab \up0
\expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab
\up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\
tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u85
92?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100
\u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex
100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\par\pard\li3118\sb0\sl-261
\slmult0\fi29\tx3546\tx3944\tx4332\tx5235\tx5634\tx6033\tx6421\tx7324\tx7722\tx8
121\tx8509 \up0 \expndtw0\charscalex93 \ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \e
xpndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\char
scalex93 4\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 1\t
ab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 4\tab \up0 \exp
ndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charsc
alex93 1\tab \up0 \expndtw0\charscalex93 4\par\pard\li3118\sb0\sl-180\slmult0\fi
0\tx3516\tx3915\tx4313\tx5206\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \
up0 \expndtw-6\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\tab \up0 \expnd
tw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \e
xpndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up
0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab
\up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?
\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8
592?\tab \up0 \expndtw-6\charscalex100 \u8592?\par\pard\li3118\sb0\sl-261\slmult
0\fi29\tx3546\tx3934\tx4343\tx5235\tx5634\tx6022\tx6431\tx7324\tx7722\tx8110\tx8
519 \up0 \expndtw0\charscalex93 \ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \expndtw0
\charscalex93 2\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex9
3 3\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 1\tab \up0
\expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\c

harscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93

4\tab \up0 \expndtw0\charscalex93 1\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx351
6\tx3915\tx4313\tx5206\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \ex
pndtw-6\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-6\ch
arscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expn
dtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \
expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \u
p0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\ta
b \up0 \expndtw-6\charscalex100 \u8592?\par\pard\li3118\sb0\sl-261\slmult0\fi29\
tx3535\tx3944\tx4343\tx5235\tx5624\tx6033\tx6431\tx7324\tx7712\tx8121\tx8519 \up
0 \expndtw0\charscalex93 \ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charsc
alex93 4\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab
\up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expnd
tw0\charscalex93 1\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscal
ex93 2\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 3\tab \
up0 \expndtw0\charscalex93 1\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx3516\tx391
5\tx4313\tx5206\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \expndtw-6
\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-6\charscale
x100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\chars
calex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\c
harscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw
-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \exp
ndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0
\expndtw-6\charscalex100 \u8592?\par\pard\li3118\sb0\sl-261\slmult0\fi29\tx3546\
tx3944\tx4332\tx5235\tx5634\tx6033\tx6421\tx7324\tx7722\tx8110\tx8519 \up0 \expn
dtw0\charscalex93 \ul0\nosupersub\cf3\f4\fs29 4\tab \up0 \expndtw0\charscalex93
1\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab \up0 \
expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\cha
rscalex93 1\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 4\
tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 3\tab \up0 \ex
pndtw0\charscalex93 1\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx3516\tx3915\tx431
3\tx5206\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \expndtw-6\charsc
alex100 \ul0\nosupersub\cf4\f5\fs20 \u8594?\tab \up0 \expndtw-6\charscalex100 \u
8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex10
0 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscal
ex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\char
scalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\
charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndt
w-6\charscalex100 \u8594?\par\pard\li3118\sb0\sl-261\slmult0\fi18\tx3546\tx3944\
tx4343\tx5225\tx5634\tx6033\tx6431\tx7313\tx7722\tx8121\tx8519 \up0 \expndtw0\ch
arscalex93 \ul0\nosupersub\cf3\f4\fs29 4\tab \up0 \expndtw0\charscalex93 1\tab \
up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw
0\charscalex93 4\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex
93 2\tab \up0 \expndtw0\charscalex93 1\tab \up0 \expndtw0\charscalex93 4\tab \up
0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 1\tab \up0 \expndtw0\
charscalex93 3\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx3516\tx3915\tx4313\tx520
6\tx5605\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \expndtw-6\charscalex100
\ul0\nosupersub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\t
ab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u859
2?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \
u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex1
00 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charsca
lex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\cha
rscalex100 \u8594?\par\pard\li3118\sb0\sl-261\slmult0\fi29\tx3535\tx3944\tx4343\
tx5235\tx5624\tx6033\tx6431\tx7324\tx7712\tx8121\tx8519 \up0 \expndtw0\charscale
x93 \ul0\nosupersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charscalex93 4\tab \up0 \ex
pndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\chars
calex93 3\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 2\ta
b \up0 \expndtw0\charscalex93 1\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expn

dtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 1\tab \up0 \expndtw0\charsca

lex93 3\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx3516\tx3915\tx4313\tx5206\tx560
5\tx6003\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \expndtw-6\charscalex100 \ul0\n
osupersub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0
\expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab
\up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\
tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u85
92?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100
\u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex
100 \u8594?\par\pard\li3118\sb0\sl-261\slmult0\fi29\tx3546\tx3934\tx4343\tx5235\
tx5634\tx6022\tx6431\tx7324\tx7722\tx8110\tx8519 \up0 \expndtw0\charscalex93 \ul
0\nosupersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\
charscalex93 4\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93
3\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 4\tab \up0
\expndtw0\charscalex93 1\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\ch
arscalex93 1\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 3
\par\pard\li3118\sb0\sl-180\slmult0\fi0\tx3516\tx3915\tx4313\tx5206\tx5605\tx600
3\tx6402\tx7294\tx7693\tx8091\tx8490 \up0 \expndtw-6\charscalex100 \ul0\nosupers
ub\cf4\f5\fs20 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expnd
tw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \e
xpndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8592?\tab \up
0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8594?\tab
\up0 \expndtw-6\charscalex100 \u8592?\tab \up0 \expndtw-6\charscalex100 \u8592?
\tab \up0 \expndtw-6\charscalex100 \u8594?\tab \up0 \expndtw-6\charscalex100 \u8
594?\par\pard\li3118\sb0\sl-261\slmult0\fi29\tx3535\tx3944\tx4343\tx5225\tx5634\
tx6033\tx6431\tx7324\tx7722\tx8121\tx8519 \up0 \expndtw0\charscalex93 \ul0\nosup
ersub\cf3\f4\fs29 1\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charsca
lex93 2\tab \up0 \expndtw0\charscalex93 4\tab \up0 \expndtw0\charscalex93 3\tab
\up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscalex93 1\tab \up0 \expndt
w0\charscalex93 4\tab \up0 \expndtw0\charscalex93 2\tab \up0 \expndtw0\charscale
x93 1\tab \up0 \expndtw0\charscalex93 3\tab \up0 \expndtw0\charscalex93 4\par\pa
rd\ql \li432\sb30\sl-333\slmult0 \up0 \expndtw0\charscalex96 Proof. Observe that
when n is not the largest mobile the direction of n must be either like \par\pa
rd\ql \li4870\sb53\sl-230\slmult0 \up0 \expndtw-2\charscalex100 \ul0\nosupersub\
cf4\f5\fs20 \u8592? \par\pard\li5169\sb0\sl-261\slmult0\fi0\tx6753 \up0 \expndtw
0\charscalex95 \ul0\nosupersub\cf3\f4\fs29 n or\tab \up0 \expndtw0\charscalex9
5 n\par\pard\qj \li432\ri261\sb91\sl-350\slmult0 \up0 \expndtw0\charscalex100 in
the permutation. When the largest mobile m (with m < n) is switched with its ta
rget \up0 \expndtw0\charscalex96 integer to produce a new permutation, the direc
tion of n will be changed simultaneously, \up0 \expndtw0\charscalex96 and the pe
rmutation with direction becomes \par\pard\ql \li4791\sb50\sl-230\slmult0 \up0 \
expndtw-2\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8594? \par\pard\li5090\sb0
\sl-261\slmult0\fi0\tx6675 \up0 \expndtw0\charscalex96 \ul0\nosupersub\cf3\f4\fs
29 n or\tab \up0 \expndtw0\charscalex96 n .\par\pard\qj \li432\ri261\sb83\sl-3
60\slmult0 \up0 \expndtw0\charscalex96 Now n is the largest mobile. Switching n
with its target integer for n \u8722? 1 times to produce \up0 \expndtw0\charscal
ex95 n \u8722? 1 more permutations, we obtain exactly n new permutations (includ
ing the one before \up0 \expndtw0\charscalex100 switching n). Each member k (3 \
u8804? k \u8804? n) moves k times from right to left, then k times \up0 \expndtw
0\charscalex97 from left to right, and goes in this way for (k \u8722? 1)! times
; the total number of moves is k!. \up0 \expndtw0\charscalex97 The algorithm sto
ps at the permutation \par\pard\li432\sb60\sl-230\slmult0\fi4448\tx5159\tx5438\t
x5717\tx6570 \up0 \expndtw-5\charscalex100 \ul0\nosupersub\cf4\f5\fs20 \u8592?\t
ab \up0 \expndtw-5\charscalex100 \u8592?\tab \up0 \expndtw-5\charscalex100 \u859
4?\tab \up0 \expndtw0\charscalex101 \u8594?\tab \dn4 \expndtw0\charscalex101 \u8
594?\par\pard\li432\sb0\sl-261\slmult0\fi4478\tx5189\tx5467\tx5746\tx6076\tx6586
\dn3 \expndtw0\charscalex101 \ul0\nosupersub\cf3\f4\fs29 2\tab \dn3 \expndtw0\c
harscalex101 1\tab \dn3 \expndtw0\charscalex101 3\tab \dn3 \expndtw0\charscalex1
01 4\tab \up0 \expndtw0\charscalex72 \tab \up0 \expndtw0\charscalex101 n .\par\pa
rd\li432\sb0\sl-333\slmult0\par\pard\li432\sb0\sl-333\slmult0\par\pard\li432\sb2

40\sl-333\slmult0\fi0\tx916 \up0 \expndtw0\charscalex101 2\tab \up0 \expndtw0\ch

arscalex101 Inversions of Permutations\par\pard\qj \li432\ri261\sb272\sl-360\slm
ult0 \up0 \expndtw0\charscalex92 Let u\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\
f4\fs29 u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 . . . u\ul0\sub\cf4\
f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 be a permutation of S = \{1, 2, . . . , n\
}. We can view u\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 u\ul0\sub\cf4\
f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 . . . u\ul0\sub\cf4\f5\fs30 n\ul0\nosupers
ub\cf3\f4\fs29 as a bijection \up0 \expndtw0\charscalex92 \u960? : S \u8594? S
defined by \par\pard\li3412\sb164\sl-333\slmult0\fi0\tx6343\tx7093 \up0 \expndtw
-1\charscalex100 \u960?(1) = u\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
, \u960?(2) = u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 ,\tab \up0 \exp
ndtw0\charscalex99 . . . ,\tab \up0 \expndtw-1\charscalex100 \u960?(n) = u\ul0\s
ub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 .\par\pard\qj \li432\ri261\sb124\sl360\slmult0\tx1117 \up0 \expndtw0\charscalex119 If u\ul0\sub\cf4\f5\fs30 i \tab
\up0 \expndtw0\charscalex106 \ul0\nosupersub\cf3\f4\fs29 > u\ul0\sub\cf4\f5\fs30
j\ul0\nosupersub\cf3\f4\fs29 for some i < j, the ordered pair (u\ul0\sub\cf4
\f5\fs30 i\ul0\nosupersub\cf3\f4\fs29 , u\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\c
f3\f4\fs29 ) is called an inversion of \u960?. The \line\up0 \expndtw-6\charsc
alex100 number of inversions of \u960? is denoted by inv(\u960?). For example, t
he permutation 3241765 of \line \up0 \expndtw-7\charscalex100 \{1, 2, . . . , 7\
} has the inversions: \par\pard\ql \li3059\sb143\sl-333\slmult0 \up0 \expndtw0\c
harscalex90 (2,1), (3, 1), (4, 1), (3, 2), (6, 5), (7, 5), (7, 6). \par\pa
rd\ql \li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb81\sl-253\slmult0 \up0 \e
xpndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 3
{\shp {\*\shpinst\shpleft11178\shptop11060\shpright11178\shpbottom10871\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz998\shplid0{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop10875\shpright11351\shpbottom10875\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1002\shplid1{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop11056\shpright11351\shpbottom11056\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1006\shplid2{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop11060\shpright11355\shpbottom10871\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1010\shplid3{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart P
g4}{\bkmkend Pg4}\par\pard\qj \li432\ri262\sb303\sl-360\slmult0 \up0 \expndtw-3\
charscalex100 \ul0\nosupersub\cf3\f4\fs29 For k \u8712? \{1, 2, . . . , n\} and
u\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 = k, let a\ul0\sub\cf4\f5\f
s30 k\ul0\nosupersub\cf3\f4\fs29 be the number of integers that precede k in t
he \up0 \expndtw-4\charscalex100 permutation u\ul0\sub\cf4\f5\fs30 1\ul0\nosuper
sub\cf3\f4\fs29 u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 . . . u\ul0\
sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 but greater than k, i.e., \par\pa
rd\ql \li1789\sb243\sl-333\slmult0 \up0 \expndtw0\charscalex111 a\ul0\sub\cf4\f5
\fs30 k\ul0\nosupersub\cf3\f4\fs29 = #\{u\ul0\sub\cf4\f5\fs30 i\ul0\nosupersub
\cf3\f4\fs29 : u\ul0\sub\cf4\f5\fs30 i\ul0\nosupersub\cf3\f4\fs29 > u\ul0\su
b\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 = k, i < j\} = #\{\u960?(i) : \u960
?(i) > \u960?(j) = k, i < j\}. \par\pard\qj \li432\ri261\sb205\sl-360\slmult0 \u
p0 \expndtw0\charscalex97 It measures how much k is out of order by counting the
numbers of integers larger than \up0 \expndtw0\charscalex99 k but located befor
e k. The tuple (a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\
cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 n\ul0\n

osupersub\cf3\f4\fs29 ) is called the inversion sequence (or \up0 \expndtw0\char

scalex97 inversion table) of the permutation \u960? = u\ul0\sub\cf4\f5\fs30 1\ul
0\nosupersub\cf3\f4\fs29 u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 . .
. u\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 . The sum a\ul0\sub\cf4\f5
\fs30 1\ul0\nosupersub\cf3\f4\fs29 +a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\
f4\fs29 + +a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 measures \up0 \e
xpndtw0\charscalex97 the total disorder of a permutation, and is denoted by inv(
\u960?). \par\pard\qj \li432\ri262\sb180\sl-360\slmult0 \up0 \expndtw0\charscale
x97 Example 2.1. The inversion sequence of the permutation 3241765 of \{1, 2
, . . . , 7\} is \up0 \expndtw0\charscalex97 (3,1,0,0,2,1,0). \par\pard\qj \li43
2\ri127\sb180\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex91 It is clear that
for any permutation \u960? of \{1, 2, . . . , n\}, the inversion sequence (a\ul0
\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul0\nosu
persub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29
) \up0 \expndtw0\charscalex91 of \u960? satisfies \par\pard\li1922\sb241\sl-333\
slmult0\fi0\tx4116\tx6310\tx7061\tx11017 \up0 \expndtw-3\charscalex100 0 \u8804?
a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \u8804? n \u8722? 1,\tab \
up0 \expndtw-3\charscalex100 0 \u8804? a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf
3\f4\fs29 \u8804? n \u8722? 2,\tab \up0 \expndtw0\charscalex97 . . . ,\tab \up
0 \expndtw-3\charscalex100 0 \u8804? a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosuper
sub\cf3\f4\fs29 \u8804? 1, a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs2
9 = 0.\tab \up0 \expndtw0\charscalex97 (1)\par\pard\ql \li432\sb230\sl-333\slm
ult0 \up0 \expndtw-8\charscalex100 It is easy to see that the number of sequence
s (a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\
ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\
f4\fs29 ) satisfying (1) equals \par\pard\ql \li4467\sb248\sl-333\slmult0 \up0 \
expndtw0\charscalex90 n (n \u8722? 1) 2 1 = n!. \par\pard\qj \li432\ri2362\sb93\
sl-520\slmult0 \up0 \expndtw0\charscalex94 This suggests that the inversion sequ
ences may be characterized by (1). \up0 \expndtw0\charscalex94 Theorem 2.1. Let
(a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul
0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4
\fs29 ) be an integer sequence satisfying \par\pard\li1922\sb228\sl-333\slmult0\
fi0\tx4116\tx6310\tx7061 \up0 \expndtw-3\charscalex100 0 \u8804? a\ul0\sub\cf4\f
5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \u8804? n \u8722? 1,\tab \up0 \expndtw-3\c
harscalex100 0 \u8804? a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 \u88
04? n \u8722? 2,\tab \up0 \expndtw0\charscalex97 . . . ,\tab \up0 \expndtw-3\cha
rscalex100 0 \u8804? a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29
\u8804? 1, a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 = 0.\par\par
d\ql \li432\sb235\sl-333\slmult0 \up0 \expndtw-11\charscalex97 Then there is a u
nique permutation \u960? of \{1, 2, . . . , n\} whose inversion sequence is (a\u
l0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul0\no
supersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs2
9 ) \par\pard\qj \li432\ri261\sb185\sl-360\slmult0 \up0 \expndtw0\charscalex100
Proof. We give two algorithms to uniquely construct the permutation whose invers
ion \up0 \expndtw0\charscalex87 sequence is (a\ul0\sub\cf4\f5\fs30 1\ul0\nosuper
sub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a
\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 ). \par\pard\ql \li432\sb263\s
l-333\slmult0 \up0 \expndtw0\charscalex100 Algorithm I. Construction of a Permut
ation from Its Inversion Sequence: \par\pard\li770\sb35\sl-333\slmult0\fi0\tx230
4 \up0 \expndtw0\charscalex94 Step 0.\tab \up0 \expndtw0\charscalex94 Write down
n.\par\pard\li770\sb26\sl-333\slmult0\fi0\tx2304 \up0 \expndtw0\charscalex94 St
ep 1.\tab \up0 \expndtw-7\charscalex100 If a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\n
osupersub\cf3\f4\fs29 = 0, place n \u8722? 1 before n; if a\ul0\sub\cf4\f5\fs3
0 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 = 1, place n \u8722? 1 after n.\par\par
d\li770\sb27\sl-333\slmult0\fi0\tx2304 \up0 \expndtw0\charscalex94 Step 2.\tab \
up0 \expndtw-6\charscalex100 If a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\c
f3\f4\fs29 = 0, place n \u8722? 2 before the two members n and n \u8722? 1; if
a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 = 1,\par\pard\qj \
li2304\ri716\sb1\sl-360\slmult0 \up0 \expndtw0\charscalex98 place n \u8722? 2 be
tween n and n \u8722? 1; if a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f

4\fs29 = 2, place n \u8722? 2 after both n \up0 \expndtw0\charscalex98 and n \

u8722? 1. \par\pard\ql \li770\sb0\sl-333\slmult0 \par\pard\ql\li770\sb30\sl-333\
slmult0\tx2304 \up0 \expndtw0\charscalex95 Step k. \tab \up0 \expndtw0\charscale
x106 If a\ul0\sub\cf4\f5\fs30 n\u8722?k\ul0\nosupersub\cf3\f4\fs29 = 0, place
n \u8722? k to the left of the first position; if a\ul0\sub\cf4\f5\fs30 n\u8722?
k\ul0\nosupersub\cf3\f4\fs29 = 1, \par\pard\qj \li2304\ri732\sb5\sl-360\slmult
0 \up0 \expndtw0\charscalex100 place n \u8722? k to the right of the 1st existin
g number; if a\ul0\sub\cf4\f5\fs30 n\u8722?k\ul0\nosupersub\cf3\f4\fs29 = 2, p
lace \up0 \expndtw1\charscalex100 n \u8722? k to the right of the 2nd existing n
umber; . . .; if a\ul0\sub\cf4\f5\fs30 n\u8722?k\ul0\nosupersub\cf3\f4\fs29 =
k, place \up0 \expndtw-1\charscalex100 n \u8722? k to the right of the last exis
ting number. In general, insert n \u8722? k \up0 \expndtw-2\charscalex100 to the
right of the a\ul0\sub\cf4\f5\fs30 n\u8722?k\ul0\nosupersub\cf3\f4\fs29 -th ex
isting number. \par\pard\ql \li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\s
l-253\slmult0 \par\pard\ql\li5849\sb203\sl-253\slmult0 \up0 \expndtw-10\charscal
ex94 \ul0\nosupersub\cf5\f6\fs22 4 \par\pard\sect\sectd\fs24\paperw11900\paperh1
6820\pard\sb0\sl-240{\bkmkstart Pg5}{\bkmkend Pg5}\par\pard\ql \li770\sb325\sl-3
33\slmult0 \up0 \expndtw-6\charscalex100 \ul0\nosupersub\cf3\f4\fs29 Step n \u87
22? 1. If a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 0, place 1 bef
ore all existing numbers; otherwise, place 1 to the \par\pard\ql \li2304\sb28\sl
-333\slmult0 \up0 \expndtw-3\charscalex100 right of the a\ul0\sub\cf4\f5\fs30 1\
ul0\nosupersub\cf3\f4\fs29 th existing number. \par\pard\qj \li432\ri262\sb185\s
l-360\slmult0\fi338 \up0 \expndtw0\charscalex93 For example, for the inversion s
equence (a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\f
s30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 8\ul0\nosupersu
b\cf3\f4\fs29 ) = (4, 6, 1, 0, 3, 1, 1, 0), its per\up0 \expndtw0\charscalex93 m
utation can be constructed by Algorithm I as follows: \par\pard\li1767\sb215\sl333\slmult0\fi0\tx3090 \up0 \expndtw0\charscalex95 8\tab \up0 \expndtw0\charscal
ex95 Write down 8.\par\pard\li1767\sb27\sl-333\slmult0\fi0\tx3090 \up0 \expndtw0
\charscalex95 87\tab \up0 \expndtw0\charscalex95 Since a\ul0\sub\cf4\f5\fs30 7\u
l0\nosupersub\cf3\f4\fs29 = 1, insert 7 to the right of the first number 8.\pa
r\pard\li1767\sb26\sl-333\slmult0\fi0\tx3090 \up0 \expndtw0\charscalex95 867\tab
\up0 \expndtw0\charscalex95 Since a\ul0\sub\cf4\f5\fs30 6\ul0\nosupersub\cf3\f4
\fs29 = 1, insert 6 to the right of the first number 8.\par\pard\li1767\sb27\s
l-333\slmult0\fi0\tx3090 \up0 \expndtw0\charscalex95 8675\tab \up0 \expndtw0\cha
rscalex95 Since a\ul0\sub\cf4\f5\fs30 5\ul0\nosupersub\cf3\f4\fs29 = 3, insert
5 to the right of the third number 7.\par\pard\li1767\sb27\sl-333\slmult0\fi0\t
x3091 \up0 \expndtw0\charscalex95 48675\tab \up0 \expndtw0\charscalex95 Since a\
ul0\sub\cf4\f5\fs30 4\ul0\nosupersub\cf3\f4\fs29 = 0, insert 4 to the left of
the first number 8.\par\pard\li1767\sb26\sl-333\slmult0\fi0\tx3091 \up0 \expndtw
0\charscalex95 438675\tab \up0 \expndtw0\charscalex95 Since a\ul0\sub\cf4\f5\fs3
0 3\ul0\nosupersub\cf3\f4\fs29 = 1, insert 3 to the right of the first number
4.\par\pard\li1767\sb27\sl-333\slmult0\fi0\tx3091 \up0 \expndtw0\charscalex95 43
86752\tab \up0 \expndtw0\charscalex95 Since a\ul0\sub\cf4\f5\fs30 2\ul0\nosupers
ub\cf3\f4\fs29 = 6, insert 2 to the right of the sixth number 5.\par\pard\li17
67\sb27\sl-333\slmult0\fi0\tx3091 \up0 \expndtw0\charscalex85 43861752\tab \up0
\expndtw0\charscalex95 Since a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
= 4, insert 1 to the right of the fifth number 6.\par\pard\qj \li432\ri1900\sb
182\sl-360\slmult0\tx770 \up0 \expndtw0\charscalex100 Algorithm II. Construction
of a Permutation from Its Inversion Sequence: \line\tab \up0 \expndtw0\charscal
ex98 Step 0. Mark down n empty spaces \u9633?\u9633?\u9633? \u9633?\u9633?\u963
3?. \par\pard\qj \li770\ri3804\sb0\sl-360\slmult0 \up0 \expndtw-2\charscalex100
Step 1. Put 1 into the (a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 + 1
)-th empty space from left. \line \up0 \expndtw-2\charscalex100 Step 2. Put 2 i
nto the (a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 + 1)-th empty space
from left. \par\pard\ql \li770\sb0\sl-333\slmult0 \par\pard\ql\li770\sb90\sl-33
3\slmult0 \up0 \expndtw-1\charscalex100 Step k. Put k into the (a\ul0\sub\cf4\f
5\fs30 k\ul0\nosupersub\cf3\f4\fs29 + 1)-th empty space from left. \par\pard\qj
\li770\ri1096\sb170\sl-620\slmult0 \up0 \expndtw0\charscalex99 Step n. Put n i
nto the (a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 + 1)-th empty space

(the last empty box) from left. \up0 \expndtw0\charscalex93 For example, the pe
rmutation for the inversion sequence \par\pard\ql \li3730\sb198\sl-333\slmult0 \
up0 \expndtw-12\charscalex93 (a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
, a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5
\fs30 8\ul0\nosupersub\cf3\f4\fs29 ) = (4, 6, 1, 0, 3, 1, 1, 0) \par\pard\ql \li
432\sb248\sl-333\slmult0 \up0 \expndtw0\charscalex96 can be constructed by Algor
ithm II as follows: \par\pard\ql \li2100\sb208\sl-333\slmult0 \up0 \expndtw0\cha
rscalex103 \u9633?\u9633?\u9633?\u9633?\u9633?\u9633?\u9633?\u9633? Mark down 8
empty spaces. \par\pard\ql \li2100\sb28\sl-333\slmult0 \up0 \expndtw0\charscale
x100 \u9633?\u9633?\u9633?\u9633?1\u9633?\u9633?\u9633? Since a\ul0\sub\cf4\f5
\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 4, put 1 into the 5th empty space. \par\p
ard\li2100\sb32\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscalex95 \u9633?\u9
633?\u9633?\u9633?1\u9633?\u9633?2\tab \up0 \expndtw-5\charscalex100 Since a\ul0
\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 = 6, put 2 into the 7th empty sp
ace.\par\pard\li2100\sb26\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscalex95
\u9633?3\u9633?\u9633?1\u9633?\u9633?2\tab \up0 \expndtw-5\charscalex100 Since a
\ul0\sub\cf4\f5\fs30 3\ul0\nosupersub\cf3\f4\fs29 = 1, put 3 into the 2nd empt
y space.\par\pard\li2100\sb27\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscale
x95 43\u9633?\u9633?1\u9633?\u9633?2\tab \up0 \expndtw-5\charscalex100 Since a\u
l0\sub\cf4\f5\fs30 4\ul0\nosupersub\cf3\f4\fs29 = 0, put 4 into the 1st empty
space.\par\pard\li2100\sb27\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscalex9
5 43\u9633?\u9633?1\u9633?52\tab \up0 \expndtw-5\charscalex100 Since a\ul0\sub\c
f4\f5\fs30 5\ul0\nosupersub\cf3\f4\fs29 = 3, put 5 into the 4th empty space.\p
ar\pard\li2100\sb26\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscalex95 43\u96
33?61\u9633?52\tab \up0 \expndtw-5\charscalex100 Since a\ul0\sub\cf4\f5\fs30 6\u
l0\nosupersub\cf3\f4\fs29 = 1, put 6 into the 2nd empty space.\par\pard\li2100
\sb27\sl-333\slmult0\fi0\tx4084 \up0 \expndtw0\charscalex95 43\u9633?61752\tab \
up0 \expndtw-5\charscalex100 Since a\ul0\sub\cf4\f5\fs30 7\ul0\nosupersub\cf3\f4
\fs29 = 1, put 7 into the 2nd empty space.\par\pard\li2100\sb26\sl-333\slmult0
\fi0\tx4085 \up0 \expndtw0\charscalex95 43861752\tab \up0 \expndtw-5\charscalex1
00 Since a\ul0\sub\cf4\f5\fs30 8\ul0\nosupersub\cf3\f4\fs29 = 0, put 8 into th
e 1st empty space.\par\pard\ql \li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb
0\sl-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\
sl-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\sl
-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb108\sl
-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 5
{\shp {\*\shpinst\shpleft11178\shptop13992\shpright11178\shpbottom13802\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz596\shplid0{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop13806\shpright11351\shpbottom13806\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz600\shplid1{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop13988\shpright11351\shpbottom13988\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz604\shplid2{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop13992\shpright11355\shpbottom13802\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz608\shplid3{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart P
g6}{\bkmkend Pg6}\par\pard\li432\sb0\sl-333\slmult0\par\pard\li432\sb3\sl-333\sl
mult0\fi0\tx916 \up0 \expndtw0\charscalex108 \ul0\nosupersub\cf3\f4\fs29 3\tab \
up0 \expndtw0\charscalex108 Generating Combinations\par\pard\qj \li432\ri261\sb2
74\sl-360\slmult0 \up0 \expndtw0\charscalex96 Let S be an n-set. For convenience

of generating combinations of S, we take S to be the \line \up0 \expndtw0\chars

calex87 set \par\pard\ql \li3986\sb23\sl-333\slmult0 \up0 \expndtw-2\charscalex1
00 S = \{x\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\
cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 , . . . , x\ul0\sub\cf4\f5\fs30
2\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs
29 , x\ul0\sub\cf4\f5\fs30 0\ul0\nosupersub\cf3\f4\fs29 \}. \par\pard\qj \li432\
ri262\sb125\sl-360\slmult0 \up0 \expndtw0\charscalex97 Each subset A of S can be
identified as a function \u967?\ul0\sub\cf4\f5\fs30 A\ul0\nosupersub\cf3\f4\fs2
9 : S \u8594? \{0, 1\}, called the character\up0 \expndtw0\charscalex97 istic
function of A, defined by \par\pard\ql \li5455\sb1\sl-287\slmult0 \up0 \expndtw0
\charscalex97 \{\par\pard\sect\sectd\sbknone\cols2\colno1\colw5610\colsr160\coln
o2\colw5990\colsr160\ql \li4364\sb81\sl-333\slmult0 \up0 \expndtw0\charscalex114
\u967?\ul0\sub\cf4\f5\fs30 A\ul0\nosupersub\cf3\f4\fs29 (x) =\par\pard\column \
ql \li20\sb0\sl-261\slmult0\tx365 \up0 \expndtw0\charscalex85 1\tab \up0 \expndt
w0\charscalex109 if x \u8712? A\par\pard\ql \li20\sb1\sl-331\slmult0\tx365 \up0
\expndtw0\charscalex85 0\tab \up0 \expndtw0\charscalex108 if x \u8712? A. \par
\pard\sect\sectd\sbknone \li432\sb189\sl-333\slmult0\fi0 \up0 \expndtw0\charscal
ex97 In practice, \u967?\ul0\sub\cf4\f5\fs30 A\ul0\nosupersub\cf3\f4\fs29 is r
epresented by a 0-1 sequence or a base 2 numeral. For example, for\par\pard\sec
t\sectd\sbknone \li432\sb26\sl-333\slmult0\fi0 \up0 \expndtw-5\charscalex100 S =
\{x\ul0\sub\cf4\f5\fs30 7\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 6\
ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 5\ul0\nosupersub\cf3\f4\fs29
, x\ul0\sub\cf4\f5\fs30 4\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 3\u
l0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 ,
x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 0\ul
0\nosupersub\cf3\f4\fs29 \},\par\pard\li3581\sb205\sl-333\slmult0\fi1549\tx7102
\up0 \expndtw0\charscalex93 \u8709?\tab \up0 \expndtw0\charscalex93 00000000\par
\pard\li3581\sb26\sl-333\slmult0\fi790\tx7102 \up0 \expndtw-8\charscalex100 \{x\
ul0\sub\cf4\f5\fs30 7\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 5\ul0\n
osupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , x\u
l0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \}\tab \up0 \expndtw0\charscalex
93 10100110\par\pard\li3581\sb27\sl-333\slmult0\fi592\tx7102 \up0 \expndtw-8\cha
rscalex100 \{x\ul0\sub\cf4\f5\fs30 6\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\
f5\fs30 5\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 3\ul0\nosupersub\cf
3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f
5\fs30 0\ul0\nosupersub\cf3\f4\fs29 \}\tab \up0 \expndtw0\charscalex93 01101011\
par\pard\li3581\sb27\sl-333\slmult0\fi0\tx7102 \up0 \expndtw-8\charscalex100 \{x
\ul0\sub\cf4\f5\fs30 7\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 6\ul0\
nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 5\ul0\nosupersub\cf3\f4\fs29 , x\
ul0\sub\cf4\f5\fs30 4\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 3\ul0\n
osupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , x\u
l0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 0\ul0\no
supersub\cf3\f4\fs29 \}\tab \up0 \expndtw0\charscalex93 11111111\par\pard\qj \li
432\ri217\sb169\sl-360\slmult0\tx770 \up0 \expndtw-2\charscalex100 Algorithm 3.1
. The algorithm for Generating Combinations of \{x\ul0\sub\cf4\f5\fs30 n\u8722?1
\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3
\f4\fs29 , . . . , x\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , x\ul0\su
b\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , x\ul0\sub\cf4\f5\fs30 0\ul0\nosuper
sub\cf3\f4\fs29 \}: \line\tab \up0 \expndtw-12\charscalex100 Step 0. Begin with
a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs3
0 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 0\ul0\nosupersub\cf3\f4\fs2
9 = 0 00. \par\pard\ql \li770\sb23\sl-333\slmult0 \up0 \expndtw-12\charscalex9
7 Step 1. If a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\s
ub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 0\ul0\nosupers
ub\cf3\f4\fs29 = 1 11, stop. \par\pard\ql \li770\ri1204\sb5\sl-360\slmult0\tx1
771 \up0 \expndtw-6\charscalex100 Step 2. If a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0
\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul
0\sub\cf4\f5\fs30 0\ul0\nosupersub\cf3\f4\fs29 = 1 11, find the smallest integ
er j such that a\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 = 0. \up0 \e
xpndtw-5\charscalex100 Step 3. Change a\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3

\f4\fs29 , a\ul0\sub\cf4\f5\fs30 j\u8722?1\ul0\nosupersub\cf3\f4\fs29 , . . . ,

a\ul0\sub\cf4\f5\fs30 0\ul0\nosupersub\cf3\f4\fs29 (either from 0 to 1 or fro
m 1 to 0), write down \line\tab \up0 \expndtw-8\charscalex100 a\ul0\sub\cf4\f5\f
s30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub
\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 0\ul0\nosupersub\cf3\f4\fs29 , and return to
Sept 1. \par\pard\ql \li770\sb103\sl-333\slmult0 \up0 \expndtw0\charscalex97 For
n = 4, the algorithm produces the list \par\pard\li4110\sb191\sl-333\slmult0\fi
0\tx5118\tx6127\tx7135 \up0 \expndtw0\charscalex85 0000\tab \up0 \expndtw0\chars
calex85 0100\tab \up0 \expndtw0\charscalex85 1000\tab \up0 \expndtw0\charscalex8
5 1100\par\pard\li4110\sb27\sl-333\slmult0\fi0\tx5118\tx6127\tx7135 \up0 \expndt
w0\charscalex85 0001\tab \up0 \expndtw0\charscalex85 0101\tab \up0 \expndtw0\cha
rscalex85 1001\tab \up0 \expndtw0\charscalex85 1101\par\pard\li4110\sb26\sl-333\
slmult0\fi0\tx5118\tx6127\tx7135 \up0 \expndtw0\charscalex85 0010\tab \up0 \expn
dtw0\charscalex85 0110\tab \up0 \expndtw0\charscalex85 1010\tab \up0 \expndtw0\c
harscalex85 1110\par\pard\li4110\sb27\sl-333\slmult0\fi0\tx5118\tx6127\tx7135 \u
p0 \expndtw0\charscalex85 0011\tab \up0 \expndtw0\charscalex85 0111\tab \up0 \ex
pndtw0\charscalex85 1011\tab \up0 \expndtw0\charscalex85 1111\par\pard\qj \li432
\ri261\sb172\sl-353\slmult0\fi338 \up0 \expndtw0\charscalex94 The unit n-cube Q\
ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 is a graph whose vertex set is
the set of all 0-1 sequences of length \line \up0 \expndtw0\charscalex97 n, and
two sequences are adjacent if they differ in only one place. A Gray code of ord
er \line \up0 \expndtw0\charscalex97 n is a path of Q\ul0\sub\cf4\f5\fs30 n\ul0\
nosupersub\cf3\f4\fs29 that visits every vertex of Q\ul0\sub\cf4\f5\fs30 n\ul0
\nosupersub\cf3\f4\fs29 exactly once, i.e., a Hamilton path of Q\ul0\sub\cf4\f
5\fs30 n\ul0\nosupersub\cf3\f4\fs29 . \line \up0 \expndtw0\charscalex97 For exam
ple, \par\pard\ql \li2656\sb24\sl-333\slmult0 \up0 \expndtw0\charscalex90 000 \u
8594? 001 \u8594? 101 \u8594? 100 \u8594? 110 \u8594? 010 \u8594? 011 \u8594? 11
1 \par\pard\qj \li432\ri260\sb125\sl-360\slmult0 \up0 \expndtw0\charscalex102 is
a Gray code of order 3. It is obvious that this Gray code can not be a part of
any \up0 \expndtw0\charscalex102 Hamilton cycle since 000 and 111 are not adjac
ent. A cyclic Gray code of order n is \up0 \expndtw0\charscalex96 a Hamilton cyc
le of Q\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 . For example, the clos
ed path \par\pard\ql \li2222\sb203\sl-333\slmult0 \up0 \expndtw0\charscalex90 00
0 \u8594? 001 \u8594? 011 \u8594? 010 \u8594? 110 \u8594? 111 \u8594? 101 \u8594
? 100 \u8594? 000 \par\pard\ql \li432\sb228\sl-333\slmult0 \up0 \expndtw0\charsc
alex94 is a cyclic Gray code of order 3. \par\pard\ql \li5849\sb0\sl-253\slmult0
\par\pard\ql\li5849\sb81\sl-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosu
persub\cf5\f6\fs22 6 \par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\
sl-240{\bkmkstart Pg7}{\bkmkend Pg7}\par\pard\ql \li770\sb325\sl-333\slmult0 \up
0 \expndtw0\charscalex95 \ul0\nosupersub\cf3\f4\fs29 For n = 1, we have the Gray
code 0 \u8594? 1. \par\pard\qj \li432\ri261\sb5\sl-360\slmult0\fi338 \up0 \expn
dtw0\charscalex97 For n = 2, we use 0 \u8594? 1 to produce the path 00 \u8594? 0
1 by adding a 0 in the front, and \up0 \expndtw0\charscalex96 use 1 \u8594? 0 to
produce 11 \u8594? 10 by adding a 1 in the front, then combine the two paths to
\up0 \expndtw0\charscalex96 produce the Gray code \par\pard\ql \li4633\sb23\sl333\slmult0 \up0 \expndtw0\charscalex91 00 \u8594? 01 \u8594? 11 \u8594? 10. \pa
r\pard\qj \li432\ri261\sb125\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex96 Fo
r n = 3, we use the Gray code (of order 2) 00 \u8594? 01 \u8594? 11 \u8594? 10 t
o produce the path \line \up0 \expndtw0\charscalex92 000 \u8594? 001 \u8594? 011
\u8594? 010 by adding 0 in the front, and use the Gray code 10 \u8594? 11 \u859
4? 01 \u8594? \line \up0 \expndtw0\charscalex95 00 (the reverse of 00 \u8594? 01
\u8594? 11 \u8594? 10) to produce the path 110 \u8594? 111 \u8594? 101 \u8594?
100 by \line \up0 \expndtw0\charscalex95 adding 1 in the front. Combine the two
paths to produce the Gray code of order 3 \par\pard\ql \li2617\sb243\sl-333\slmu
lt0 \up0 \expndtw0\charscalex90 000 \u8594? 001 \u8594? 011 \u8594? 010 \u8594?
110 \u8594? 111 \u8594? 101 \u8594? 100. \par\pard\ql \li432\sb248\sl-333\slmult
0 \up0 \expndtw0\charscalex98 The Gray codes obtained in this way are called ref
lected Gray codes. \par\pard\qj \li432\ri1787\sb165\sl-360\slmult0\tx770 \up0 \e
xpndtw0\charscalex100 Algorithm 3.2. Algorithm of generating a Reflected Gray Co
de of order n: \line\tab \up0 \expndtw0\charscalex90 Step 0. Begin with a\ul0\su

b\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\n

osupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\
sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 00 0. \par\pard\ql \li770\sb23\
sl-333\slmult0 \up0 \expndtw-12\charscalex100 Step 1. If a\ul0\sub\cf4\f5\fs30 n
\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30
1\ul0\nosupersub\cf3\f4\fs29 = 10 00, stop. \par\pard\qj \li770\ri383\sb5\sl360\slmult0\tx1771 \up0 \expndtw0\charscalex94 Step 2. If a\ul0\sub\cf4\f5\fs30
n\ul0\nosupersub\cf3\f4\fs29 + a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\c
f3\f4\fs29 + + a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 + a\ul0\sub\
cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = even, then change a\ul0\sub\cf4\f5\
fs30 1\ul0\nosupersub\cf3\f4\fs29 (either from 0 to 1 or from \line\tab \up0 \
expndtw0\charscalex94 1 to 0). \par\pard\ql \li770\sb1\sl-287\slmult0 \up0 \expn
dtw0\charscalex100 Step 3. If a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29
+ a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 + a\ul0\sub\cf4
\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 + a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub
\cf3\f4\fs29 = odd, find the smallest index j such that \par\pard\ql \li1771\s
b36\sl-333\slmult0 \up0 \expndtw-4\charscalex100 a\ul0\sub\cf4\f5\fs30 j\ul0\nos
upersub\cf3\f4\fs29 = 1 and change a\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf
3\f4\fs29 (either from 0 to 1 or from 1 to 0). \par\pard\ql \li770\sb1\sl-293\
slmult0 \up0 \expndtw-7\charscalex100 Step 4. Write down a\ul0\sub\cf4\f5\fs30 n
\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30
1\ul0\nosupersub\cf3\f4\fs29 and return to Step 1. \par\pard\qj \li432\ri261\
sb198\sl-353\slmult0\fi338 \up0 \expndtw-5\charscalex100 We note that if a\ul0\s
ub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\
nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 1
0 0 and a\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 + a\ul0\sub\cf4\f5\f
s30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 + + a\ul0\sub\cf4\f5\fs30 1\ul0\nosupe
rsub\cf3\f4\fs29 = odd, then j \u8804? n \u8722? 1 \up0 \expndtw-1\charscalex1
00 so that j + 1 \u8804? n and a\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf3\f4\f
s29 is defined. We also note that the smallest number j in Step 3 \up0 \expndt
w-4\charscalex100 may be 1, i.e., a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\
fs29 = 1; if so there is no i < j such that a\ul0\sub\cf4\f5\fs30 i\ul0\nosupe
rsub\cf3\f4\fs29 = 0 and we change a\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf
3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 as \up0 \expn
dtw-6\charscalex100 instructed in Step 3. \par\pard\qj \li432\ri261\sb182\sl-360
\slmult0 \up0 \expndtw0\charscalex98 Proof. We proceed by induction on n. For n
= 1, it is obviously true. For n = 2, we have \up0 \expndtw0\charscalex98 00 \u8
594? 01 \u8594? 11 \u8594? 10. Let n \u8805? 3 and assume that it is true for 1,
2, . . . , n \u8722? 1. \par\pard\qj \li432\ri261\sb0\sl-360\slmult0\fi338 \up0
\expndtw-2\charscalex100 (1) When the algorithm is applied, by the induction hy
pothesis the first resulted 2\ul0\super\cf4\f5\fs29 n\u8722?1 \up0 \expndtw-4\ch
arscalex100 \ul0\nosupersub\cf3\f4\fs29 words form the reflected Gray code of or
der n \u8722? 1 with a 0 attached to the head of each \up0 \expndtw-5\charscalex
100 word; the 2\ul0\super\cf4\f5\fs29 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 -th w
ord is 010 0. \par\pard\ql \li770\sb23\sl-333\slmult0 \up0 \expndtw0\charscalex9
6 (2) Continuing the algorithm, we have \par\pard\ql \li4649\sb248\sl-333\slmult
0 \up0 \expndtw0\charscalex80 010 0 \u8594? 110 0. \par\pard\qj \li432\ri261\sb2
31\sl-353\slmult0 \up0 \expndtw0\charscalex93 Now for each word of the form 11b\
ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30
1\ul0\nosupersub\cf3\f4\fs29 , the parity of 11b\ul0\sub\cf4\f5\fs30 n\u8722?2\u
l0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
is the same as the \up0 \expndtw0\charscalex95 parity of b\ul0\sub\cf4\f5\fs30 n
\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\
f4\fs29 . Continuing the algorithm, the next 2\ul0\super\cf4\f5\fs29 n\u8722?2\
ul0\nosupersub\cf3\f4\fs29 words (including 110 0) \up0 \expndtw0\charscalex98
form a reflected Gray code (of order n \u8722? 2) with a 11 attached at the beg
inning; the last \up0 \expndtw0\charscalex86 word is 1110 0. \par\pard\ql \li770
\sb24\sl-333\slmult0 \up0 \expndtw0\charscalex96 (3) Continuing the algorithm, w

e have \par\pard\ql \li4157\sb248\sl-333\slmult0 \up0 \expndtw0\charscalex81 111

0 0 \u8594? 1010 0 \u8594? \par\pard\ql \li5849\sb0\sl-253\slmult0 \par\par
li5849\sb81\sl-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\
fs22 7 \par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkst
art Pg8}{\bkmkend Pg8}\par\pard\qj \li432\ri261\sb323\sl-360\slmult0 \up0 \expnd
tw0\charscalex98 \ul0\nosupersub\cf3\f4\fs29 The next 2\ul0\super\cf4\f5\fs29 n\
u8722?3\ul0\nosupersub\cf3\f4\fs29 words (including 1010 0) form a reflected G
ray code (of order n \u8722? 3) \up0 \expndtw0\charscalex98 with a 101 attached
at the beginning; the last word is 10110 0. \par\pard\qj \li432\ri261\sb0\sl-360
\slmult0\fi338 \up0 \expndtw0\charscalex92 (4)10110 0 \u8594? 10010 0 \u8594?; t
here are 2\ul0\super\cf4\f5\fs29 n\u8722?4\ul0\nosupersub\cf3\f4\fs29 words wi
th 1001 attached at the begin-\line \up0 \expndtw0\charscalex92 ning. \par\pard\
ql \li770\sb0\sl-333\slmult0 \par\pard\ql\li770\sb70\sl-333\slmult0 \up0 \expndt
w0\charscalex97 (n \u8722? 2) Continuing the algorithm, we have \par\pard\ql \li
4004\sb188\sl-333\slmult0 \up0 \expndtw0\charscalex83 10 01100 \u8594? 10 00100
\u8594? . \par\pard\qj \li432\ri261\sb165\sl-360\slmult0 \up0 \expndtw0\charscal
ex97 The next 2\ul0\super\cf4\f5\fs29 2\ul0\nosupersub\cf3\f4\fs29 words (incl
uding 10 0100) form a reflected Gray code (of order 2) with \up0 \expndtw0\chars
calex90 10 01 attached at the beginning; the last word is 10 0110. \par\pard\ql
\li770\sb23\sl-333\slmult0\tx3320 \up0 \expndtw0\charscalex90 (n \u8722? 1) 10
0110 \tab \up0 \expndtw0\charscalex90 \u8594? 10 0010 \u8594? 10 0011; there
are 2\ul0\super\cf4\f5\fs29 1\ul0\nosupersub\cf3\f4\fs29
words (of order
1), \par\pard\ql \li432\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex89 10 0010
\u8594? 10 0011, with 10 001 attached at the beginning. \par\pard\qj \li770\ri12
29\sb5\sl-360\slmult0 \up0 \expndtw0\charscalex90 (n) 10 0011 \u8594? 10 0001. T
he algorithm produces only 1 word 10 0001. \up0 \expndtw0\charscalex90 (n + 1) F
inally, the algorithm ends at 10 0001 \u8594? 10 0000. \par\pard\qj \li432\ri290
\sb0\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex98 Note that all words produc
ed from Step (k) to Step (n + 1) inclusive are distinct from \up0 \expndtw0\char
scalex100 the words produced in Step (k \u8722? 1), where 2 \u8804? k \u8804? n
+ 1. Thus the words produced by \up0 \expndtw0\charscalex100 the algorithm are d
istinct and the total number of words is \par\pard\ql \li3365\sb183\sl-333\slmul
t0 \up0 \expndtw-3\charscalex100 2\ul0\nosupersub\cf4\f5\fs20 n\u8722?1\ul0\nosu
persub\cf3\f4\fs29 + 2\ul0\super\cf4\f5\fs29 n\u8722?2\ul0\nosupersub\cf3\f4\fs
29 + + 2\ul0\super\cf4\f5\fs29 2\ul0\nosupersub\cf3\f4\fs29 + 2\ul0\super\cf4\
f5\fs29 1\ul0\nosupersub\cf3\f4\fs29 + 2\ul0\super\cf4\f5\fs29 0\ul0\nosupersub
\cf3\f4\fs29 + 1 = 2\ul0\super\cf4\f5\fs29 n\ul0\nosupersub\cf3\f4\fs29 . \par\
pard\qj \li432\ri264\sb165\sl-360\slmult0 \up0 \expndtw0\charscalex98 This impli
es that the sequence of the words produced forms the reflected Gray code of \up0
\expndtw0\charscalex98 order n. \par\pard\qj \li432\ri261\sb0\sl-360\slmult0\fi
338 \up0 \expndtw0\charscalex95 Next we show that the words resulted in the seco
nd half of the algorithm are the words \line \up0 \expndtw0\charscalex96 obtaine
d from the reversing of the reflected Gray codes of order n \u8722? 1 with 1 att
ached in \line \up0 \expndtw0\charscalex96 the front. Consider two consecutive w
ords of length n in the second half of the algorithm, \line \up0 \expndtw0\chars
calex82 say, \par\pard\li432\sb27\sl-333\slmult0\fi3069 \up0 \expndtw-11\charsca
lex97 1 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4
\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosup
ersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \u8594? 1
b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs3
0 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\c
f3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 .\par\pard\li432\s
b130\sl-333\slmult0\fi0 \up0 \expndtw0\charscalex89 We need to show that\par\par
d\ql \li3729\sb60\sl-287\slmult0 \up0 \expndtw-11\charscalex95 b\ul0\sub\cf4\f5\
fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\no
supersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 b\ul0\s
ub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \u8594? a\ul0\sub\cf4\f5\fs30 n\u8
722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\
cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5
\fs30 1 \par\pard\ql \li432\sb136\sl-333\slmult0 \up0 \expndtw0\charscalex97 \ul

0\nosupersub\cf3\f4\fs29 by the same algorithm for n \u8722? 1. \par\pard\qj \li

432\ri261\sb5\sl-360\slmult0\fi338 \up0 \expndtw-9\charscalex100 Note that 1 a\u
l0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\
u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 and 1 b\ul0\sub\cf4\
f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0
\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 b\ul
0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 have opposite parity. It follow
s that \up0 \expndtw-9\charscalex100 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosuper
sub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul
0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosup
ersub\cf3\f4\fs29 and b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs
29 b\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\
fs30 2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\
fs29 have opposite parity. We have two cases. \par\pard\ql \li770\sb51\sl-299\
slmult0 \up0 \expndtw-9\charscalex100 (1) b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\no
supersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29
b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\
nosupersub\cf3\f4\fs29 is even. Then a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupe
rsub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\u
l0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosu
persub\cf3\f4\fs29 is odd. It follows that 1 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul
0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\f
s29 a\ul0\sub\cf4\f5\fs30 2 \up0 \expndtw-11\charscalex96 \ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 1 \par\pard\qj \li432\ri261\sb19\sl-350\slmult0 \up
0 \expndtw-1\charscalex100 \ul0\nosupersub\cf3\f4\fs29 is even. By definition o
f the algorithm, we have b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\f
s29 = a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 , b\ul0\sub\c
f4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 n\u872
2?2\ul0\nosupersub\cf3\f4\fs29 , . . ., b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\c
f3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , \up0 \expndt
w0\charscalex100 and b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 1 \u
8722? a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 ; i.e., a\ul0\sub\cf4\f
5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 = b\ul0\sub\cf4\f5\fs30 n\u8722?1\
ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\
f4\fs29 = b\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 , . . .,
and a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = 1 \u8722? b\ul0\sub\c
f4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 . This means that \up0 \expndtw-11\char
scalex95 b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf
4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosu
persub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \u8594?
a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30
n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf
3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 . \par\pard\ql \li4
32\ri77\sb2\sl-360\slmult0\fi338 \up0 \expndtw-10\charscalex100 (2) b\ul0\sub\cf
4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 n\u8722?2\u
l0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 b\
ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 is odd. Then a\ul0\sub\cf4\f5\
fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\no
supersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\s
ub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 is even. It follows that 1 a\ul0\su
b\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 n\u8722
?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs2
9 a\ul0\sub\cf4\f5\fs30 1 \up0 \expndtw-8\charscalex100 \ul0\nosupersub\cf3\f4\f
s29 is odd. Since 1 a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a
\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30
2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
\u8594? 1 b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\ul0\su
b\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\
nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , then

by definition of the algorithm, \up0 \expndtw0\charscalex100 there exists an in

dex j (1 \u8804? j \u8804? n \u8722? 2) such that a\ul0\sub\cf4\f5\fs30 1\ul0\no
supersub\cf3\f4\fs29 = = a\ul0\sub\cf4\f5\fs30 j\u8722?1\ul0\nosupersub\cf3\f4
\fs29 = b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = = b\ul0\sub\cf4
\f5\fs30 j\u8722?1\ul0\nosupersub\cf3\f4\fs29 = 0, \up0 \expndtw0\charscalex10
0 a\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 = b\ul0\sub\cf4\f5\fs30 j
\ul0\nosupersub\cf3\f4\fs29 = 1, and b\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\
cf3\f4\fs29 = 1 \u8722? a\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf3\f4\fs29 ,
b\ul0\sub\cf4\f5\fs30 j+2\ul0\nosupersub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30
j+2\ul0\nosupersub\cf3\f4\fs29 , . . ., b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosu
persub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs2
9 . Note that a\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf3\f4\fs29 = 1 \u8722?
b\ul0\sub\cf4\f5\fs30 j+1\ul0\nosupersub\cf3\f4\fs29 . \up0 \expndtw-8\charscal
ex100 We see that b\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 b\u
l0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2
\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
\u8594? a\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf
4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosu
persub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 by defin
ition of the algorithm. \par\pard\ql \li5849\sb0\sl-253\slmult0 \par\pard\ql\li5
849\sb76\sl-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs2
2 8 \par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart
Pg9}{\bkmkend Pg9}\par\pard\li432\sb0\sl-333\slmult0\par\pard\li432\sb0\sl-333\
slmult0\par\pard\li432\sb0\sl-333\slmult0\par\pard\li432\sb128\sl-333\slmult0\fi
0\tx916 \up0 \expndtw0\charscalex109 \ul0\nosupersub\cf3\f4\fs29 4\tab \up0 \exp
ndtw0\charscalex109 Generating r-Combinations\par\pard\qj \li432\ri261\sb283\sl360\slmult0 \up0 \expndtw-2\charscalex100 Let S = \{1, 2, . . . , n\}. When a
n r-combination or an r-subset A = \{a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf
3\f4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\s
ub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 \} of \line \up0 \expndtw-1\charsca
lex100 S is given, we always assume that a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\
cf3\f4\fs29 < a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 < < a\ul0
\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 . For two r-combinations A = \l
ine \up0 \expndtw-5\charscalex100 \{a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f
4\fs29 , a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\
cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 \} and B = \{b\ul0\sub\cf4\f5\fs30 1\u
l0\nosupersub\cf3\f4\fs29 , b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 ,
. . . , b\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 \} of S, if there i
s an integer k (1 \u8804? k \u8804? r) such that \par\pard\li2926\sb243\sl-333\s
lmult0\fi0\tx5400\tx6151 \up0 \expndtw-9\charscalex100 a\ul0\sub\cf4\f5\fs30 1\u
l0\nosupersub\cf3\f4\fs29 = b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
, a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 = b\ul0\sub\cf4\f5\fs3
0 2\ul0\nosupersub\cf3\f4\fs29 ,\tab \up0 \expndtw0\charscalex92 . . . ,\tab \up
0 \expndtw-8\charscalex100 a\ul0\sub\cf4\f5\fs30 k\u8722?1\ul0\nosupersub\cf3\f4
\fs29 = b\ul0\sub\cf4\f5\fs30 k\u8722?1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\s
ub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 < b\ul0\sub\cf4\f5\fs30 k\ul0\nosu
persub\cf3\f4\fs29 ,\par\pard\qj \li432\ri261\sb205\sl-360\slmult0 \up0 \expndt
w0\charscalex106 we say that A precedes B in the lexicographic order, written A
< B. Then the set \up0 \expndtw-3\charscalex100 P\ul0\sub\cf4\f5\fs30 r\ul0\nosu
persub\cf3\f4\fs29 (S) of all r-subsets of S is linearly ordered by the lexicog
raphic order. For simplicity, \up0 \expndtw-4\charscalex100 we write an r-combi
nation \{a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , a\ul0\sub\cf4\f5\f
s30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersu
b\cf3\f4\fs29 \} as an r-permutation \par\pard\ql \li3628\sb243\sl-333\slmult0
\up0 \expndtw-11\charscalex100 a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs2
9 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul
0\nosupersub\cf3\f4\fs29
with a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4
\fs29 < a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 < < a\ul0\sub\cf4
\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 . \par\pard\qj \li432\ri262\sb225\sl-360\
slmult0 \up0 \expndtw0\charscalex95 Theorem 4.1. Let a\ul0\sub\cf4\f5\fs30 1\ul0

\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul

0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 be an r-combination of \{1, 2, .
. . , n\}. The first r-combination \up0 \expndtw0\charscalex95 in lexicographic
order is 12 r, and the last r-combination in lexicographic order is \par\pard\q
l \li4448\sb243\sl-333\slmult0 \up0 \expndtw0\charscalex96 (n \u8722? r + 1) (n
\u8722? 1)n. \par\pard\qj \li432\ri261\sb225\sl-360\slmult0 \up0 \expndtw-6\char
scalex100 If a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5
\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 = (n\u8722?r+1) (n\
u8722?1)n and k is the largest index such that a\ul0\sub\cf4\f5\fs30 k\ul0\nosup
ersub\cf3\f4\fs29 = n\u8722?r+k, \up0 \expndtw-12\charscalex95 then the succes
sor of a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30
2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29
is \par\pard\ql \li2964\sb243\sl-333\slmult0 \up0 \expndtw-6\charscalex100 a\
ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nos
upersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 k\u8722?1\ul0\nosupersub\cf3\f4\fs29
(a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 + 1)(a\ul0\sub\cf4\f5\fs30
k\ul0\nosupersub\cf3\f4\fs29 + 2) (a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f
4\fs29 + r \u8722? k + 1). \par\pard\qj \li432\ri300\sb205\sl-360\slmult0 \up0
\expndtw1\charscalex100 Proof. Since a\ul0\sub\cf4\f5\fs30 i\ul0\nosupersub\cf3\
f4\fs29 \u8804? (n \u8722? r + i) for all 1 \u8804? i \u8804? r, then a\ul0\su
b\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 = n \u8722? r + k implies a\ul0\sub
\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 < n \u8722? r + k. \up0 \expndtw0\ch
arscalex100 Hence a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 + r \u8722
? k + 1 < n + 1. \par\pard\qj \li432\ri262\sb180\sl-360\slmult0 \up0 \expndtw0\c
harscalex102 Algorithm 4.2. Algorithm for Generating r-Combinations of \{1, 2,
. . . , n\} in Lexico\up0 \expndtw0\charscalex95 graphic Order: \par\pard\qj \l
i770\ri3603\sb0\sl-360\slmult0 \up0 \expndtw-9\charscalex100 Step 0. Begin with
the r-combination a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\c
f4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\
cf3\f4\fs29 = 12 r. \up0 \expndtw-9\charscalex100 Step 1. If a\ul0\sub\cf4\f5\
fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\
fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 = (n \u8722? r + 1) (
n \u8722? 1)n, stop. \par\pard\qj \li770\ri1266\sb0\sl-360\slmult0\tx1771 \up0 \
expndtw0\charscalex100 Step 2. If a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\
fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r
\ul0\nosupersub\cf3\f4\fs29 = (n \u8722? r + 1) (n \u8722? 1)n, find the larg
est k such that \line\tab \up0 \expndtw-1\charscalex100 a\ul0\sub\cf4\f5\fs30 k\
ul0\nosupersub\cf3\f4\fs29 < n \u8722? r + k. \par\pard\ql \li770\sb1\sl-263\s
lmult0 \up0 \expndtw-8\charscalex100 Step 3. Change a\ul0\sub\cf4\f5\fs30 1\ul0\
nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0
\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 to a\ul0\sub\cf4\f5\fs30 1\ul0\no
supersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 k\u8722?1\ul0\nosupersub\cf3\f4\fs29
(a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 + 1)(a\ul0\sub\cf4\f5\fs30
k\ul0\nosupersub\cf3\f4\fs29 + 2) (a\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\
f4\fs29 +r \u8722?k + 1), write \par\pard\ql \li1771\sb40\sl-333\slmult0 \up0 \
expndtw-10\charscalex100 down a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29
a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0
\nosupersub\cf3\f4\fs29 , and return back to Step 1. \par\pard\qj \li432\ri292\
sb105\sl-360\slmult0 \up0 \expndtw0\charscalex100 Example 4.1. The collection o
f all 4-combinations of \{1, 2, 3, 4, 5, 6\} are listed by the \up0 \expndtw0\ch
arscalex100 algorithm: \par\pard\li4100\sb5\sl-333\slmult0\fi0\tx4862\tx5623\tx6
385\tx7147 \up0 \expndtw0\charscalex85 1234\tab \up0 \expndtw0\charscalex85 1245
\tab \up0 \expndtw0\charscalex85 1345\tab \up0 \expndtw0\charscalex85 1456\tab \
up0 \expndtw0\charscalex85 2356\par\pard\li4100\sb26\sl-333\slmult0\fi0\tx4862\t
x5623\tx6385\tx7147 \up0 \expndtw0\charscalex85 1235\tab \up0 \expndtw0\charscal
ex85 1246\tab \up0 \expndtw0\charscalex85 1346\tab \up0 \expndtw0\charscalex85 2
345\tab \up0 \expndtw0\charscalex85 2456\par\pard\li4100\sb27\sl-333\slmult0\fi0
\tx4862\tx5623\tx6385\tx7147 \up0 \expndtw0\charscalex85 1236\tab \up0 \expndtw0
\charscalex85 1256\tab \up0 \expndtw0\charscalex85 1356\tab \up0 \expndtw0\chars

calex85 2346\tab \up0 \expndtw0\charscalex85 3456\par\pard\ql \li5849\sb0\sl-253

\slmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb0\sl-253\s
lmult0 \par\pard\ql\li5849\sb0\sl-253\slmult0 \par\pard\ql\li5849\sb83\sl-253\sl
mult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 9
{\shp {\*\shpinst\shpleft11178\shptop831\shpright11178\shpbottom641\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz7\shplid0{\sp{\sn shapeType}{\sv
20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn lineWi
dth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop645\shpright11351\shpbottom645\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz11\shplid1{\sp{\sn shapeType}{\s
v 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn lineW
idth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop827\shpright11351\shpbottom827\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz15\shplid2{\sp{\sn shapeType}{\s
v 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn lineW
idth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop831\shpright11355\shpbottom641\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz19\shplid3{\sp{\sn shapeType}{\s
v 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn lineW
idth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11178\shptop9398\shpright11178\shpbottom9208\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz928\shplid4{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop9212\shpright11351\shpbottom9212\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz932\shplid5{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop9394\shpright11351\shpbottom9394\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz936\shplid6{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop9398\shpright11355\shpbottom9208\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz940\shplid7{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820
{\shp {\*\shpinst\shpleft292\shptop2304\shpright11411\shpbottom2791\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl208 \li0\ri0 \expndtw-9\charscale
x100\ul0\nosupersub\cf3\f4\fs29 Proof. The r-combinatio(s b\ul0\sub\cf4\f5\fs30
1\ul0\nosupersub\cf3\f4\fs29 b\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29
b\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 after a\ul0\sub\cf4\f5\fs3
0 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs2
9 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 can be classified into r
kinds:{\par}}}}
{\shp {\*\shpinst\shpleft4179\shptop2663\shpright8223\shpbottom3150\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001

{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s

p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw-8\charscale
x100\ul0\nosupersub\cf3\f4\fs29 such r-combinations.{\par}}}}
{\shp {\*\shpinst\shpleft7237\shptop4560\shpright11281\shpbottom5047\shpfhdr0\sh
pbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw-8\charscale
x100\ul0\nosupersub\cf3\f4\fs29 such r-combinations.{\par}}}}
{\shp {\*\shpinst\shpleft509\shptop12690\shpright4744\shpbottom13249\shpfhdr0\sh
pbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw0\charscalex
106\ul0\nosupersub\cf3\f4\fs29 2. irreflexive if x {\par}}}}
{\shp {\*\shpinst\shpleft2744\shptop12762\shpright6624\shpbottom13249\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw0\charscalex
101\ul0\nosupersub\cf3\f4\fs29 Rx (also write x \\{\par}}}}
{\shp {\*\shpinst\shpleft4756\shptop12690\shpright9675\shpbottom13249\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw-4\charscale
x100\ul0\nosupersub\cf3\f4\fs29 Rx) for all x \u8712? X , where {\par}}}}
{\shp {\*\shpinst\shpleft509\shptop13759\shpright9938\shpbottom14318\shpfhdr0\sh
pbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl212 \li0\ri0 \expndtw0\charscalex
103\ul0\nosupersub\cf3\f4\fs29 4. antisymmetric provided that if x = y and xRy t
hen y {\par}}}}\pard\sb0\sl-240{\bkmkstart Pg10}{\bkmkend Pg10}\par\pard\qj \li43
2\ri262\sb303\sl-360\slmult0 \up0 \expndtw-4\charscalex100 \ul0\nosupersub\cf3\f
4\fs29 Theorem 4.3. Let a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0
\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosup
ersub\cf3\f4\fs29 be an r-combination of \{1, 2, . . . , n\}. Then the number
of \up0 \expndtw-4\charscalex100 r-combinations up to the place a\ul0\sub\cf4\f
5\fs30 1\ul0\nosupersub\cf3\f4\fs29 a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f
4\fs29 a\ul0\sub\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 in lexicographic or
der equals\par\pard\sect\sectd\sbknone\cols3\colno1\colw4073\colsr20\colno2\colw
2567\colsr40\colno3\colw5070\colsr160\ql \li1855\sb1\sl-294\slmult0\tx2325\tx280
7\tx3796 \up0 \expndtw0\charscalex97 (\tab \up0 \expndtw0\charscalex97 )\tab \up
0 \expndtw0\charscalex97 ( \tab \up0 \expndtw0\charscalex97 )\par\pard\ql \li209
0\sb0\sl-252\slmult0\tx3042 \up0 \expndtw0\charscalex102 n\tab \up0 \expndtw-2\c
harscalex100 n \u8722? a\ul0\sub\cf4\f5\fs30 1\par\pard\ql \li2541\sb0\sl-261\sl
mult0 \up0 \expndtw0\charscalex120 \ul0\nosupersub\cf3\f4\fs29 \u8722?\par\pard\

ql \li2107\sb0\sl-261\slmult0\tx3362 \up0 \expndtw0\charscalex97 r\tab \up0 \exp

ndtw0\charscalex97 r\par\pard\ql \li770\sb0\sl-333\slmult0 \par\pard\ql \li770\s
b33\sl-333\slmult0 \up0 \expndtw-3\charscalex100 (1) b\ul0\sub\cf4\f5\fs30 1\ul0
\nosupersub\cf3\f4\fs29 > a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 ;
there are\ul0\super\cf4\f5\fs29 n\u8722?a\ul0\nosupersub\cf6\f7\fs14 1 \up0 \
expndtw-3\charscalex100 \ul0\nosupersub\cf4\f5\fs20 r\par\pard\column \ql \li335
\sb1\sl-294\slmult0\tx1375 \up0 \expndtw0\charscalex97 \ul0\nosupersub\cf3\f4\fs
29 (\tab \up0 \expndtw0\charscalex97 )\par\pard\ql \li570\sb0\sl-243\slmult0 \up
0 \expndtw-2\charscalex100 n \u8722? a\ul0\sub\cf4\f5\fs30 2\par\pard\ql \li48\s
b0\sl-261\slmult0\tx1605 \up0 \expndtw0\charscalex120 \ul0\nosupersub\cf3\f4\fs2
9 \u8722? \tab \up0 \expndtw0\charscalex94 \u8722? \u8722?\par\pard\ql \li645\sb
0\sl-261\slmult0 \up0 \expndtw0\charscalex104 r \u8722? 1\par\pard\ql \li20\sb14
3\sl-333\slmult0 \up0 \expndtw0\charscalex97 )\par\pard\ql \li407\sb27\sl-333\sl
mult0 \up0 \expndtw0\charscalex120 (\ul0\sub\cf4\f5\fs30 n\u8722?a \up0 \expndtw
-3\charscalex100 \ul0\nosupersub\cf3\f4\fs29 )\par\pard\column \ql \li20\sb1\sl294\slmult0\tx1310\tx1872\tx2902 \up0 \expndtw0\charscalex97 (\tab \up0 \expndtw
0\charscalex97 )\tab \up0 \expndtw0\charscalex97 (\tab \up0 \expndtw0\charscalex
97 )\par\pard\ql \li255\sb0\sl-234\slmult0\tx2107 \up0 \expndtw0\charscalex105 n
\u8722? a\ul0\sub\cf4\f5\fs30 r\u8722?1\tab \up0 \expndtw0\charscalex103 \ul0\n
osupersub\cf3\f4\fs29 n \u8722? a\ul0\sub\cf4\f5\fs30 r\par\pard\ql \li1580\sb0\
sl-261\slmult0 \up0 \expndtw0\charscalex120 \ul0\nosupersub\cf3\f4\fs29 \u8722?\
par\pard\ql \li698\sb0\sl-261\slmult0\tx2422 \up0 \expndtw0\charscalex85 2\tab \
up0 \expndtw0\charscalex85 1\par\pard\sect\sectd\sbknone\cols3\colno1\colw4536\c
olsr160\colno2\colw508\colsr160\colno3\colw6406\colsr160\ql \li770\sb0\sl-261\sl
mult0 \up0 \expndtw-9\charscalex100 (2) b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\c
f3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , b\ul0\sub\cf
4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 > a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersu
b\cf3\f4\fs29 ; there are\par\pard\column \ql \li340\sb0\sl-126\slmult0 \up0 \ex
pndtw-2\charscalex100 \ul0\nosupersub\cf6\f7\fs14 2\par\pard\ql \li20\sb1\sl-193
\slmult0 \up0 \expndtw0\charscalex116 \ul0\nosupersub\cf4\f5\fs20 r\u8722?1\par\
pard\column \ql \li20\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex94 \ul0\nosupe
rsub\cf3\f4\fs29 such r-combinations.\par\pard\ql \li182\sb0\sl-234\slmult0 \up0
\expndtw0\charscalex120 (\ul0\sub\cf4\f5\fs30 n\u8722?a \up0 \expndtw-3\charsca
lex100 \ul0\nosupersub\cf3\f4\fs29 )\par\pard\sect\sectd\sbknone\cols2\colno1\co
lw5571\colsr160\colno2\colw6029\colsr160\ql \li770\sb0\sl-243\slmult0 \up0 \expn
dtw-9\charscalex100 (3) b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = a
\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , b\ul0\sub\cf4\f5\fs30 2\ul0\
nosupersub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 ,
b\ul0\sub\cf4\f5\fs30 3\ul0\nosupersub\cf3\f4\fs29 > a\ul0\sub\cf4\f5\fs30 3\u
l0\nosupersub\cf3\f4\fs29 ; there are\par\pard\column \ql \li341\sb0\sl-126\slmu
lt0 \up0 \expndtw-2\charscalex100 \ul0\nosupersub\cf6\f7\fs14 3\par\pard\ql \li2
0\sb0\sl-216\slmult0\tx684 \up0 \expndtw0\charscalex116 \ul0\nosupersub\cf4\f5\f
s20 r\u8722?2\tab \up0 \expndtw-7\charscalex100 \ul0\nosupersub\cf3\f4\fs29 such
r-combinations.\par\pard\ql \li1793\sb25\sl-333\slmult0\tx2650 \up0 \expndtw0\c
harscalex120 (\ul0\sub\cf4\f5\fs30 n\u8722?a\tab \up0 \expndtw-3\charscalex100 \
ul0\nosupersub\cf3\f4\fs29 )\par\pard\sect\sectd\sbknone\cols2\colno1\colw7491\c
olsr60\colno2\colw4209\colsr160\ql \li770\sb0\sl-243\slmult0 \up0 \expndtw-5\cha
rscalex100 (r \u8722? 1) b\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 =
a\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , . . ., b\ul0\sub\cf4\f5\fs3
0 r\u8722?2\ul0\nosupersub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 r\u8722?2\ul0\n
osupersub\cf3\f4\fs29 , b\ul0\sub\cf4\f5\fs30 r\u8722?1\ul0\nosupersub\cf3\f4\fs
29 > a\ul0\sub\cf4\f5\fs30 r\u8722?1\ul0\nosupersub\cf3\f4\fs29 ; th(ere a)e\p
ar\pard\ql \li770\sb16\sl-333\slmult0 \up0 \expndtw-1\charscalex100 (r) b\ul0\su
b\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 = a\ul0\sub\cf4\f5\fs30 1\ul0\nosup
ersub\cf3\f4\fs29 , . . ., b\ul0\sub\cf4\f5\fs30 r\u8722?1\ul0\nosupersub\cf3\f4
\fs29 = a\ul0\sub\cf4\f5\fs30 r\u8722?1\ul0\nosupersub\cf3\f4\fs29 , b\ul0\sub
\cf4\f5\fs30 r\ul0\nosupersub\cf3\f4\fs29 > a\ul0\sub\cf4\f5\fs30 r\ul0\nosupe
rsub\cf3\f4\fs29 ; there are\ul0\super\cf4\f5\fs29 n\u8722?a\ul0\nosupersub\c
f6\f7\fs14 r \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf4\f5\fs20 1\par\par
d\qj \li432\ri0\sb6\sl-358\slmult0\fi338 \up0 \expndtw0\charscalex95 \ul0\nosupe

rsub\cf3\f4\fs29 Since the number of r-combinations of \{1, 2, . . . , n\} is \u

p0 \expndtw0\charscalex93 mediately.\par\pard\column \ql \li509\sb0\sl-126\slmul
t0 \up0 \expndtw0\charscalex134 \ul0\nosupersub\cf6\f7\fs14 r\u8722?1\par\pard\q
l \li415\sb0\sl-216\slmult0\tx1055 \up0 \expndtw-11\charscalex94 \ul0\nosupersub
\cf4\f5\fs20 2\tab \up0 \expndtw-7\charscalex100 \ul0\nosupersub\cf3\f4\fs29 suc
h r-combinations.\par\pard\ql \li20\sb45\sl-333\slmult0 \up0 \expndtw0\charscale
x130 (\ul0\sub\cf4\f5\fs30 n \up0 \expndtw-3\charscalex100 \ul0\nosupersub\cf3\f
4\fs29 )\par\pard\ql \li188\sb46\sl-276\slmult0\tx456 \up0 \expndtw-3\charscalex
100 \ul0\nosupersub\cf4\f5\fs20 r\tab \up0 \expndtw-4\charscalex100 \ul0\nosuper
sub\cf3\f4\fs29 , the conclusion follows im-\par\pard\sect\sectd\sbknone \li432\
sb213\sl-333\slmult0\fi0 \up0 \expndtw0\charscalex95 Example 4.2. The 3-combinat
ions of \{1, 2, 3, 4, 5\} are as follows:\par\pard\li432\sb236\sl-333\slmult0\fi
2117\tx3247\tx3946\tx4645\tx5343\tx6042\tx6741\tx7440\tx8138\tx8837 \up0 \expndt
w0\charscalex92 123,\tab \up0 \expndtw0\charscalex92 124,\tab \up0 \expndtw0\cha
rscalex92 125,\tab \up0 \expndtw0\charscalex92 134,\tab \up0 \expndtw0\charscale
x92 135,\tab \up0 \expndtw0\charscalex92 145,\tab \up0 \expndtw0\charscalex92 23
4,\tab \up0 \expndtw0\charscalex92 235,\tab \up0 \expndtw0\charscalex92 245,\tab
\up0 \expndtw0\charscalex92 345\par\pard\li432\sb235\sl-333\slmult0\fi0 \up0 \e
xpndtw0\charscalex93 The 3-permutations of \{1, 2, 3, 4, 5\} can be obtained by
making 3! permutations for each\par\pard\li432\sb27\sl-333\slmult0\fi0 \up0 \exp
ndtw0\charscalex92 3-combination:\par\pard\li432\sb148\sl-333\slmult0\fi2468\tx3
521\tx4142\tx4763\tx5384\tx6005\tx6626\tx7247\tx7868\tx8489 \up0 \expndtw0\chars
calex87 123\tab \up0 \expndtw0\charscalex87 124\tab \up0 \expndtw0\charscalex87
125\tab \up0 \expndtw0\charscalex87 134\tab \up0 \expndtw0\charscalex87 135\tab
\up0 \expndtw0\charscalex87 145\tab \up0 \expndtw0\charscalex87 234\tab \up0 \ex
pndtw0\charscalex87 235\tab \up0 \expndtw0\charscalex87 245\tab \up0 \expndtw0\c
harscalex87 345\par\pard\li432\sb26\sl-333\slmult0\fi2468\tx3521\tx4142\tx4763\t
x5384\tx6005\tx6626\tx7247\tx7868\tx8489 \up0 \expndtw0\charscalex87 132\tab \up
0 \expndtw0\charscalex87 142\tab \up0 \expndtw0\charscalex87 152\tab \up0 \expnd
tw0\charscalex87 143\tab \up0 \expndtw0\charscalex87 153\tab \up0 \expndtw0\char
scalex87 154\tab \up0 \expndtw0\charscalex87 243\tab \up0 \expndtw0\charscalex87
253\tab \up0 \expndtw0\charscalex87 254\tab \up0 \expndtw0\charscalex87 354\par
\pard\li432\sb27\sl-333\slmult0\fi2468\tx3521\tx4142\tx4763\tx5384\tx6005\tx6626
\tx7247\tx7868\tx8489 \up0 \expndtw0\charscalex87 213\tab \up0 \expndtw0\charsca
lex87 214\tab \up0 \expndtw0\charscalex87 215\tab \up0 \expndtw0\charscalex87 31
4\tab \up0 \expndtw0\charscalex87 315\tab \up0 \expndtw0\charscalex87 415\tab \u
p0 \expndtw0\charscalex87 324\tab \up0 \expndtw0\charscalex87 325\tab \up0 \expn
dtw0\charscalex87 425\tab \up0 \expndtw0\charscalex87 435\par\pard\li432\sb27\sl
-333\slmult0\fi2468\tx3521\tx4142\tx4763\tx5384\tx6005\tx6626\tx7247\tx7868\tx84
89 \up0 \expndtw0\charscalex87 231\tab \up0 \expndtw0\charscalex87 241\tab \up0
\expndtw0\charscalex87 251\tab \up0 \expndtw0\charscalex87 341\tab \up0 \expndtw
0\charscalex87 351\tab \up0 \expndtw0\charscalex87 451\tab \up0 \expndtw0\charsc
alex87 342\tab \up0 \expndtw0\charscalex87 352\tab \up0 \expndtw0\charscalex87 4
52\tab \up0 \expndtw0\charscalex87 453\par\pard\li432\sb26\sl-333\slmult0\fi2468
\tx3521\tx4142\tx4763\tx5384\tx6005\tx6626\tx7247\tx7868\tx8489 \up0 \expndtw0\c
harscalex87 312\tab \up0 \expndtw0\charscalex87 412\tab \up0 \expndtw0\charscale
x87 512\tab \up0 \expndtw0\charscalex87 413\tab \up0 \expndtw0\charscalex87 513\
tab \up0 \expndtw0\charscalex87 514\tab \up0 \expndtw0\charscalex87 423\tab \up0
\expndtw0\charscalex87 523\tab \up0 \expndtw0\charscalex87 524\tab \up0 \expndt
w0\charscalex87 534\par\pard\li432\sb27\sl-333\slmult0\fi2468\tx3521\tx4142\tx47
63\tx5384\tx6005\tx6626\tx7247\tx7868\tx8489 \up0 \expndtw0\charscalex87 321\tab
\up0 \expndtw0\charscalex87 421\tab \up0 \expndtw0\charscalex87 521\tab \up0 \e
xpndtw0\charscalex87 431\tab \up0 \expndtw0\charscalex87 531\tab \up0 \expndtw0\
charscalex87 541\tab \up0 \expndtw0\charscalex87 432\tab \up0 \expndtw0\charscal
ex87 532\tab \up0 \expndtw0\charscalex87 542\tab \up0 \expndtw0\charscalex87 543
\par\pard\li432\sb0\sl-333\slmult0\par\pard\li432\sb92\sl-333\slmult0\fi0\tx916
\up0 \expndtw0\charscalex87 5\tab \up0 \expndtw0\charscalex87 Partially Ordered
Sets\par\pard\qj \li432\ri286\sb280\sl-360\slmult0 \up0 \expndtw0\charscalex100
Definition 5.1. A relation on a set X is a subset R \u8838? X X . We say that two
elements \line \up0 \expndtw0\charscalex101 x and y of X satisfy the relation R

, written xRy, if (x, y) \u8712? R. A relation R on X is said \line \up0 \expndt

w0\charscalex101 to be \par\pard\ql \li649\sb183\sl-333\slmult0 \up0 \expndtw0\c
harscalex103 1. reflexive if xRx for all x \u8712? X ; \par\pard\ql \li8044\sb20
8\sl-333\slmult0 \up0 \expndtw0\charscalex103 R := (X X ) \u-4014? R; \par\pard\
ql \li649\sb208\sl-333\slmult0 \up0 \expndtw0\charscalex103 3. symmetric provide
d that if xRy then yRx; \par\pard\li977\sb206\sl-333\slmult0\fi6872 \up0 \expndt
w0\charscalex100 Rx (equivalently, if xRy and\par\pard\li977\sb27\sl-333\slmult0
\fi0 \up0 \expndtw0\charscalex100 yRx then x = y);\par\pard\ql \li649\sb191\sl-3
33\slmult0 \up0 \expndtw0\charscalex102 5. transitive provided that if xRy and y
Rz then xRz; \par\pard\ql \li5794\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb81\sl
-253\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 10
{\shp {\*\shpinst\shpleft11178\shptop5565\shpright11178\shpbottom5375\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz802\shplid0{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop5379\shpright11351\shpbottom5379\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz806\shplid1{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop5561\shpright11351\shpbottom5561\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz810\shplid2{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop5565\shpright11355\shpbottom5375\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz814\shplid3{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart P
g11}{\bkmkend Pg11}\par\pard\ql \li649\sb325\sl-333\slmult0 \up0 \expndtw0\chars
calex102 \ul0\nosupersub\cf3\f4\fs29 6. complete provided that if x, y \u8712? X
and x = y then either xRy or yRx. \par\pard\qj \li432\ri261\sb165\sl-360\slmult
0 \up0 \expndtw0\charscalex105 Example 5.1. (1) The relation of set containment
, \u8838?, is a reflexive and transitive \up0 \expndtw0\charscalex94 relation o
n the power set P (X ) of all subsets of X . \par\pard\qj \li432\ri261\sb0\sl-36
0\slmult0\fi338 \up0 \expndtw0\charscalex101 (2) The relation of divisibility, |
, is a reflexive and transitive relation on the set Z of \up0 \expndtw0\charscal
ex90 integers. \par\pard\qj \li432\ri292\sb140\sl-360\slmult0\fi338 \up0 \expndt
w0\charscalex104 A partial order \u8804? on a set X is a reflexive, antisymmetri
c, and transitive relation, \up0 \expndtw0\charscalex104 that is, \par\pard\ql \
li770\sb23\sl-333\slmult0 \up0 \expndtw0\charscalex108 (i) x \u8804? x for all x
, \par\pard\ql \li770\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex106 (ii) x \u
8804? y and y \u8804? x then x = y, \par\pard\ql \li770\sb28\sl-333\slmult0 \up0
\expndtw0\charscalex106 (iii) if x \u8804? y and y \u8804? z then x \u8804? z.
\par\pard\ql \li432\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex103 A strict pa
rtial order on a set X is an irreflexive and transitive relation, that is, \par\
pard\ql \li770\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex107 (i) x < x for al
l x, \par\pard\ql \li770\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex105 (ii) i
f x < y and y < z then x < z. \par\pard\qj \li432\ri292\sb9\sl-355\slmult0\fi338
\up0 \expndtw0\charscalex101 If a relation R is a partial order, which is usual
ly denoted by \u8804?, then the relation <, \up0 \expndtw0\charscalex101 defined
by a < b if and only if a \u8804? b but a = b, is a strict partial order. Conv
ersely, for \up0 \expndtw0\charscalex103 a strict partial order < on a set X , t
he relation \u8804? defined by a \u8804? b if and only if a < b \up0 \expndtw0\c
harscalex104 or a = b is a partial order. A set X with a partial order \u8804? i
s called a partially ordered \up0 \expndtw0\charscalex104 set (or poset for shor
t), denoted (X, \u8804?). \par\pard\qj \li432\ri281\sb1\sl-360\slmult0\fi338 \up
0 \expndtw0\charscalex98 A linear order on a set X is a partial order \u8804? su

ch that for any two elements a and b, \line \up0 \expndtw0\charscalex99 either a
\u8804? b or b \u8804? a, i.e., a complete partial order. A strict linear order
is an irreflexive, \line \up0 \expndtw0\charscalex101 transitive, and complete
relation. A preference relation is a relation which is reflexive \line \up0 \exp
ndtw0\charscalex101 and transitive. An equivalence relation is a reflexive, symm
etric, and transitive relation. \par\pard\ql \li432\sb183\sl-333\slmult0 \up0 \e
xpndtw0\charscalex102 Example 5.2. Let S = \{1, 2, 3, 4\}. Then relation \u8220?
larger than\u8221? in its ordinary meaning\par\pard\sect\sectd\sbknone\cols2\col
no1\colw3985\colsr40\colno2\colw7735\colsr160\ql \li432\sb33\sl-333\slmult0 \up0
\expndtw0\charscalex97 is the relation\par\pard\ql \li2988\sb26\sl-333\slmult0
\up0 \expndtw0\charscalex120 \u8220? > \u8221? =\par\pard\column \ql \li20\sb159
\sl-333\slmult0\tx4573 \up0 \expndtw0\charscalex97 \{\tab \up0 \expndtw0\charsca
lex97 \}\par\pard\ql \li187\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex90 (2,1)
, (3, 1), (4, 1), (3, 2), (4, 2), (4, 3) \up0 \expndtw0\charscalex97 , \par\pard
\sect\sectd\sbknone \li432\sb113\sl-333\slmult0\fi0 \up0 \expndtw0\charscalex99
and it is a strict linear order relation. The relation \u8220?less than or equal
to\u8221? in its ordinary\par\pard\sect\sectd\sbknone \li432\sb26\sl-333\slmult
0\fi0 \up0 \expndtw0\charscalex98 meaning is the relation\par\pard\li1483\sb1\sl
-313\slmult0\fi1041\tx10078 \up0 \expndtw0\charscalex93 \{\tab \up0 \expndtw0\ch
arscalex93 \}\par\pard\li1483\sb0\sl-261\slmult0\fi0\tx2692\tx10246 \up0 \expndt
w0\charscalex93 \u8220? \u8804? \u8221? =\tab \up0 \expndtw0\charscalex90 (1,1),
(1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4), (3, 3), (3, 4), (4, 4)\tab \up0
\expndtw0\charscalex93 ,\par\pard\ql \li432\sb178\sl-333\slmult0 \up0 \expndtw0
\charscalex96 and is a linear order relation. \par\pard\qj \li432\ri282\sb165\sl
-360\slmult0 \up0 \expndtw0\charscalex102 Example 5.3. Let C be the set of all
\u8730?omplex numbers. Let R be the relation on C, \line \up0 \expndtw0\charsca
lex99 defined by zRw if |z| = |w|, where |z| = a\ul0\super\cf4\f5\fs29 2\ul0\n
osupersub\cf3\f4\fs29 + b\ul0\super\cf4\f5\fs29 2\ul0\nosupersub\cf3\f4\fs29
if z = a + ib, is an equivalence relation \line \up0 \expndtw0\charscalex99 on C
. \par\pard\qj \li432\ri292\sb0\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex10
4 The relation L on C, defined by zLw (where z = a + ib and w = c + id) if a < c
or \up0 \expndtw0\charscalex98 a = c but b \u8804? d, is a linear order on C. \
par\pard\qj \li432\ri293\sb140\sl-360\slmult0 \up0 \expndtw0\charscalex102 Examp
le 5.4. Let V be a vector space over R. A partial order \u8828? on V is said
to be \up0 \expndtw0\charscalex102 compatible with the addition and scalar mult
iplication if \par\pard\ql \li770\sb23\sl-333\slmult0 \up0 \expndtw0\charscalex9
9 (ii) u \u8828? v implies cu \u8828? cv for all c \u8805? 0; \par\pard\ql \li57
94\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb81\sl-253\slmult0 \up0 \expndtw-10\c
harscalex94 \ul0\nosupersub\cf5\f6\fs22 11
{\shp {\*\shpinst\shpleft5681\shptop12460\shpright6513\shpbottom12460\shpfhdr0\s
hpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz888\shplid0{\sp{\sn shapeType}
{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn li
neWidth}{\sv 8668}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820\pard\sb0\sl-240{\bkmkstart P
g12}{\bkmkend Pg12}\par\pard\ql \li770\sb325\sl-333\slmult0 \up0 \expndtw-8\char
scalex100 \ul0\nosupersub\cf3\f4\fs29 (ii) u\ul0\sub\cf4\f5\fs30 1\ul0\nosupersu
b\cf3\f4\fs29 \u8828? v\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 and
u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 \u8828? v\ul0\sub\cf4\f5\f
s30 2\ul0\nosupersub\cf3\f4\fs29 imply u\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\
cf3\f4\fs29 + u\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 \u8828? v\ul
0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 + v\ul0\sub\cf4\f5\fs30 2\ul0\no
supersub\cf3\f4\fs29 . \par\pard\qj \li432\ri3174\sb5\sl-360\slmult0\tx770 \up0
\expndtw0\charscalex105 The property (ii) implies the translation preserving pro
perty \line\tab \up0 \expndtw0\charscalex100 (iii) if u \u8828? v then u + w \u8
828? v + w for all w \u8712? V . \par\pard\ql \li770\sb143\sl-333\slmult0 \up0 \
expndtw0\charscalex99 A strongly convex cone of V is a nonempty subset C \u8834
? V such that \par\pard\ql \li770\sb28\sl-333\slmult0 \up0 \expndtw0\charscalex
96 (i) if u \u8712? V and c \u8805? 0 then cu \u8712? V ; \par\pard\ql \li770\s
b28\sl-333\slmult0 \up0 \expndtw0\charscalex99 (ii) if u, v \u8712? C then u + v
\u8712? C; and \par\pard\ql \li770\sb28\sl-333\slmult0 \up0 \expndtw0\charscale

x99 (iii) there is no nonzero vector u such that u, \u8722?u \u8712? C, i.e., if
u, \u8722?u \u8712? C then u = 0. \par\pard\ql \li770\sb148\sl-333\slmult0 \up0
\expndtw0\charscalex96 Given a strongly convex cone C of V . Then the relation
\u8828? on V , defined by \par\pard\ql \li3840\sb248\sl-333\slmult0 \up0 \expndt
w0\charscalex101 u \u8828? v if and only if v \u8722? u \u8712? C, \par\pard
\qj \li432\ri261\sb225\sl-360\slmult0 \up0 \expndtw0\charscalex97 is a partial o
rder compatible with the addition and scalar multiplication. Clearly, (i) u \u88
28? u \up0 \expndtw0\charscalex108 for all u \u8712? V ; (ii) if u \u8828? v and
v \u8828? u then u = v; (iii) u \u8828? v and v \u8828? w, then u \u8828? w; \u
p0 \expndtw0\charscalex99 (iv) if u \u8828? v then u + w \u8828? v + w for all w
\u8712? V . Conversely, given a partial order \u8828? on V \up0 \expndtw0\chars
calex99 compatible with the addition and scalar multiplication. Then the subset
\par\pard\ql \li4622\sb223\sl-333\slmult0 \up0 \expndtw0\charscalex99 C := \{v \
u8712? V | v \u8829? 0\} \par\pard\ql \li432\sb248\sl-333\slmult0 \up0 \expndtw
0\charscalex92 is a strongly convex cone of V . \par\pard\qj \li432\ri261\sb5\sl
-360\slmult0\fi338 \up0 \expndtw0\charscalex98 Let H be a subspace of V . Then t
he relation \u8764? on V , defined by u \u8764? v if v \u8722? u \u8712? H , \up
0 \expndtw0\charscalex98 is an equivalence relation on V . \par\pard\qj \li432\r
i261\sb180\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex103 Let \u8804?\ul0\su
b\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 and \u8804?\ul0\sub\cf4\f5\fs30 2\
ul0\nosupersub\cf3\f4\fs29 be two partial orders on a set X . The poset (X,
\u8804?\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 ) is called an \up0 \ex
pndtw0\charscalex103 extension of the poset (X, \u8804?\ul0\sub\cf4\f5\fs30 1\u
l0\nosupersub\cf3\f4\fs29 ) if, whenever a \u8804?\ul0\sub\cf4\f5\fs30 1\ul0\no
supersub\cf3\f4\fs29
b, then a \u8804?\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\
cf3\f4\fs29
b. In particular, an \up0 \expndtw0\charscalex97 extension of a
partial order has more compatible pairs. We show that every finite poset \up0 \
expndtw0\charscalex97 has a linear extension, that is, an extension which is a l
inearly ordered set. \par\pard\qj \li432\ri292\sb180\sl-360\slmult0 \up0 \expndt
w0\charscalex99 Theorem 5.2. Let (X, \u8804?) be a finite partially ordered set.
Then there is a linear order \u8828? \up0 \expndtw0\charscalex99 such that (X,
\u8828?) is an extension of (X, \u8804?). \par\pard\qj \li432\ri261\sb189\sl-350
\slmult0 \up0 \expndtw-6\charscalex100 Proof. We need to show that the elements
of X can be listed in some order x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\f
s29 , x\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , x\ul0\sub\cf4
\f5\fs30 n \up0 \expndtw-1\charscalex100 \ul0\nosupersub\cf3\f4\fs29 in such a w
ay that if x\ul0\sub\cf4\f5\fs30 i\ul0\nosupersub\cf3\f4\fs29 \u8804? x\ul0\su
b\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 then x\ul0\sub\cf4\f5\fs30 i\ul0\no
supersub\cf3\f4\fs29 comes before x\ul0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3\f
4\fs29 in this list, i.e., i \u8804? j. The following \up0 \expndtw-3\charscal
ex100 algorithm does the job. \par\pard\ql \li432\sb145\sl-333\slmult0 \up0 \exp
ndtw0\charscalex101 Algorithm 5.3. Algorithm for a Linear Extension of an n-Pose
t: \par\pard\qj \li770\ri1198\sb5\sl-360\slmult0\tx1771 \up0 \expndtw0\charscale
x98 Step 1. Choose a minimal element x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\
f4\fs29 from X (with respect to the ordering \u8804?; \line\tab \up0 \expndtw0
\charscalex92 if such elements are not unique, choose any one). \par\pard\ql \li
770\sb1\sl-311\slmult0 \up0 \expndtw-4\charscalex100 Step 2. Delete x\ul0\sub\cf
4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 from X ; choose a minimal element x\ul0
\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 from X \u-4014? \{x\ul0\sub\cf4\
f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 \}. \par\pard\ql \li770\sb31\sl-333\slmult0
\up0 \expndtw-4\charscalex100 Step 3. Delete x\ul0\sub\cf4\f5\fs30 2\ul0\nosupe
rsub\cf3\f4\fs29 from X \u-4014?\{x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4
\fs29 \}; choose a minimal element x\ul0\sub\cf4\f5\fs30 3\ul0\nosupersub\cf3\f4
\fs29 from X \u-4014?\{x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , x\u
l0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f4\fs29 \}. \par\pard\qj \li770\sb0\sl-3
60\slmult0 \par\pard\qj\li770\ri1206\sb25\sl-360\slmult0\tx1771 \up0 \expndtw-5\
charscalex100 Step n. Delete x\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\
f4\fs29 from X \u-4014? \{x\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 ,
. . . , x\ul0\sub\cf4\f5\fs30 n\u8722?2\ul0\nosupersub\cf3\f4\fs29 \} and choos
e the only element x\ul0\sub\cf4\f5\fs30 n\ul0\nosupersub\cf3\f4\fs29 in \line\

tab \up0 \expndtw-6\charscalex100 X \u-4014? \{x\ul0\sub\cf4\f5\fs30 1\ul0\nosup

ersub\cf3\f4\fs29 , . . . , x\ul0\sub\cf4\f5\fs30 n\u8722?1\ul0\nosupersub\cf3\f
4\fs29 \}. \par\pard\ql \li5794\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb0\sl-25
3\slmult0 \par\pard\ql\li5794\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb150\sl-25
3\slmult0 \up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 12
{\shp {\*\shpinst\shpleft11178\shptop14837\shpright11178\shpbottom14647\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1165\shplid0{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop14651\shpright11351\shpbottom14651\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1169\shplid1{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop14833\shpright11351\shpbottom14833\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1173\shplid2{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop14837\shpright11355\shpbottom14647\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz1177\shplid3{\sp{\sn shapeTy
pe}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24\paperw11900\paperh16820
{\shp {\*\shpinst\shpleft5637\shptop5202\shpright6878\shpbottom5601\shpfhdr0\shp
bxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz10001\shplid10001
{\sp{\sn shapeType}{\sv 202}}{\sp{\sn fFlipH}{\sv 0}}{\sp{\sn fFlipV}{\sv 0}}{\s
p{\sn fRecolorFillAsPicture}{\sv 0}}{\sp{\sn fUseShapeAnchor}{\sv 0}}{\sp{\sn fL
ine}{\sv 0}}{\sp{\sn fFilled}{\sv 0}}{\sp{\sn fLayoutInCell}{\sv 1}}{\sp{\sn fBe
hindDocument}{\sv 1}}{\shptxt\pard\plain \qj\sl147 \li0\ri0 \expndtw-2\charscale
x100\ul0\nosupersub\cf4\f5\fs20 k{\par}}}}\pard\sb0\sl-240{\bkmkstart Pg13}{\bkm
kend Pg13}\par\pard\qj \li432\ri262\sb303\sl-360\slmult0\fi338 \up0 \expndtw0\ch
arscalex100 \ul0\nosupersub\cf3\f4\fs29 Let R be an equivalence relation on a se
t X . For each element x \u8712? X , we call the \up0 \expndtw0\charscalex106 s
et [x] := \{y \u8712? X | xRy\} an equivalence class of R and x a representat
ive of the \up0 \expndtw0\charscalex90 equivalence class [x]. \par\pard\qj \li43
2\ri292\sb180\sl-360\slmult0 \up0 \expndtw0\charscalex99 Theorem 5.4. Let R be a
n equivalence relation on a set X . Then for any x, y \u8712? X , the \line \up0
\expndtw0\charscalex99 following statements are logically equivalent: (i) [x]
\u8745? [y] = \u8709?; (ii) [x] = [y]; and (iii) xRy. \par\pard\ql \li770\sb203\
sl-333\slmult0 \up0 \expndtw-3\charscalex100 A collection P = \{A\ul0\sub\cf4\f5
\fs30 1\ul0\nosupersub\cf3\f4\fs29 , A\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\
f4\fs29 , . . . , A\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 \} of none
mpty subsets of a set X is called a partition \par\pard\ql \li5705\sb0\sl-216\sl
mult0 \up0 \expndtw0\charscalex106 \u8899?\ul0\sub\cf4\f5\fs30 k \par\pard\li432
\sb0\sl-261\slmult0\fi0\tx5944 \up3 \expndtw0\charscalex102 \ul0\nosupersub\cf3\
f4\fs29 of X if A\ul0\sub\cf4\f5\fs30 i\ul0\nosupersub\cf3\f4\fs29 \u8745? A\u
l0\sub\cf4\f5\fs30 j\ul0\nosupersub\cf3\f4\fs29 = \u8709? for i = j and X =\t
ab \dn4 \expndtw0\charscalex102 \ul0\nosupersub\cf4\f5\fs20 i=1\ul0\nosupersub\c
f3\f4\fs29 A\ul0\nosupersub\cf4\f5\fs20 i\ul0\super\cf3\f4\fs43 . We will show
below that if R is an\par\pard\li432\sb0\sl-261\slmult0\fi0 \up0 \expndtw0\char
scalex102 equivalence relation on a set X , then the collection\par\pard\li4675\
sb1\sl-328\slmult0\fi818\tx6040 \dn2 \expndtw0\charscalex97 \{\tab \up0 \expndtw
0\charscalex97 \u-8120?\par\pard\li4675\sb3\sl-261\slmult0\fi0\tx5660\tx6040 \dn
4 \expndtw-4\charscalex100 P\ul0\nosupersub\cf4\f5\fs20 R\ul0\nosupersub\cf3\f4\
fs29 :=\tab \up0 \expndtw0\charscalex97 [x]\tab \up0 \expndtw0\charscalex97 \u
-8120? x \u8712? X \}\par\pard\qj \li432\ri288\sb177\sl-360\slmult0 \up0 \expndt
w0\charscalex102 is a partition of X . Conversely, if P = \{A\ul0\sub\cf4\f5\

fs30 1\ul0\nosupersub\cf3\f4\fs29 , A\ul0\sub\cf4\f5\fs30 2\ul0\nosupersub\cf3\f

4\fs29 , . . . , A\ul0\sub\cf4\f5\fs30 k\ul0\nosupersub\cf3\f4\fs29 \} is a par
tition of X , then the \up0 \expndtw0\charscalex102 relation \par\pard\ql \li567
3\sb1\sl-263\slmult0 \up0 \expndtw0\charscalex120 \u8899? \par\pard\li4836\sb1\s
l-283\slmult0\fi0\tx6042 \up0 \expndtw0\charscalex105 R\ul0\sub\cf4\f5\fs30 P\ul
0\nosupersub\cf3\f4\fs29 :=\tab \up0 \expndtw0\charscalex105 A\ul0\sub\cf4\f5\
fs30 i\ul0\nosupersub\cf3\f4\fs29 A\ul0\sub\cf4\f5\fs30 i\par\pard\ql \li5671\s
b81\sl-230\slmult0 \up0 \expndtw0\charscalex116 i=1 \par\pard\ql \li432\sb65\sl333\slmult0 \up0 \expndtw0\charscalex93 \ul0\nosupersub\cf3\f4\fs29 is an equiva
lence relation on X . \par\pard\qj \li432\ri261\sb185\sl-360\slmult0 \up0 \expnd
tw0\charscalex97 Theorem 5.5. Let R be an equivalence relation on a set X , and
let P = \{A\ul0\sub\cf4\f5\fs30 1\ul0\nosupersub\cf3\f4\fs29 , A\ul0\sub\cf4\f5\
fs30 2\ul0\nosupersub\cf3\f4\fs29 , . . . , A\ul0\sub\cf4\f5\fs30 k\ul0\nosupers
ub\cf3\f4\fs29 \} \up0 \expndtw0\charscalex97 be a partition of X . Then \par\p
ard\ql \li770\sb23\sl-333\slmult0 \up0 \expndtw0\charscalex101 (i) P\ul0\sub\cf4
\f5\fs30 R\ul0\nosupersub\cf3\f4\fs29 is a partition of X ; \par\pard\ql \li77
0\sb28\sl-333\slmult0 \up0 \expndtw-5\charscalex100 (ii) R\ul0\sub\cf4\f5\fs30 P
\ul0\nosupersub\cf3\f4\fs29 is an equivalence relation on X ; \par\pard\li770\
sb35\sl-333\slmult0\fi0\tx1931\tx3287 \up0 \expndtw0\charscalex108 (iii) R\ul0\s
ub\cf4\f5\fs30 P\tab \up0 \expndtw0\charscalex108 \ul0\nosupersub\cf3\f4\fs29 =
R, P\ul0\sub\cf4\f5\fs30 R\tab \up0 \expndtw0\charscalex108 \ul0\nosupersub\cf3
\f4\fs29 = P .\par\pard\li770\sb0\sl-126\slmult0\fi940\tx3063 \up0 \expndtw0\cha
rscalex108 \ul0\nosupersub\cf6\f7\fs14 R\tab \up0 \expndtw0\charscalex108 P\par\
pard\ql \li432\sb76\sl-333\slmult0 \up0 \expndtw0\charscalex100 \ul0\nosupersub\
cf3\f4\fs29 Proof. Parts (i) and (ii) are trivial. We only prove Part (iii). \pa
r\pard\ql \li770\sb57\sl-322\slmult0 \up0 \expndtw-3\charscalex100 Let (x, y) \u
8712? R\ul0\sub\cf4\f5\fs30 P\par\pard\sect\sectd\sbknone\cols2\colno1\colw2734\
colsr20\colno2\colw9006\colsr160\ql \li2613\sb0\sl-126\slmult0 \up0 \expndtw0\ch
arscalex114 \ul0\nosupersub\cf6\f7\fs14 R\par\pard\column \ql \li20\sb0\sl-261\s
lmult0 \up0 \expndtw0\charscalex96 \ul0\nosupersub\cf3\f4\fs29 . Then, by defini
tion of equivalence relation induced from the partition \par\pard\sect\sectd\sbk
none \ql \li432\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex102 P\ul0\nosupersub
\cf4\f5\fs20 R\ul0\nosupersub\cf3\f4\fs29 , there exists a part A \u8712? P\ul0\
nosupersub\cf4\f5\fs20 R\ul0\nosupersub\cf3\f4\fs29 such that x, y \u8712? A.
Note that the parts in P\ul0\nosupersub\cf4\f5\fs20 R\ul0\nosupersub\cf3\f4\fs2
9 are the \par\pard\ql \li432\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex92 e
quivalence classes [x] of the equivalence relation R; in particular A is an equi
valence class \par\pard\ql \li432\sb6\sl-261\slmult0 \up0 \expndtw0\charscalex10
1 of R. Since A contains both x and y, it follows that A = [x] = [y]. So (x, y)
\u8712? R. Hence\par\pard\sect\sectd\sbknone\cols2\colno1\colw964\colsr40\colno2
\colw10756\colsr160\ql \li432\sb38\sl-333\slmult0 \up0 \expndtw0\charscalex101 R
\ul0\sub\cf4\f5\fs30 P \up0 \expndtw0\charscalex116 \ul0\nosupersub\cf6\f7\fs14
R\par\pard\column \ql \li20\sb38\sl-333\slmult0 \up0 \expndtw0\charscalex100 \ul
0\nosupersub\cf3\f4\fs29 \u8838? R. \par\pard\sect\sectd\sbknone \li432\sb27\sl333\slmult0\fi338 \up0 \expndtw0\charscalex103 Let (x, y) \u8712? R. Then [x] =
[y] is a part of P\ul0\sub\cf4\f5\fs30 R\ul0\nosupersub\cf3\f4\fs29 . Thus [x]
[y] \u8838? R\ul0\sub\cf4\f5\fs30 P\par\pard\sect\sectd\sbknone\cols3\colno1\co
lw4485\colsr60\colno2\colw4883\colsr20\colno3\colw2322\colsr160\ql \li432\sb27\s
l-333\slmult0 \up0 \expndtw-4\charscalex100 \ul0\nosupersub\cf3\f4\fs29 [x] [y],
we see that (x, y) \u8712? R\ul0\sub\cf4\f5\fs30 P\par\pard\column \ql \li4773\
sb0\sl-126\slmult0 \up0 \expndtw0\charscalex114 \ul0\nosupersub\cf6\f7\fs14 R\pa
r\pard\ql \li20\sb0\sl-261\slmult0 \up0 \expndtw-3\charscalex100 \ul0\nosupersub
\cf3\f4\fs29 . Therefore R \u8838? R\ul0\sub\cf4\f5\fs30 P\par\pard\column \ql \
li20\sb0\sl-261\slmult0 \up0 \expndtw0\charscalex95 \ul0\nosupersub\cf3\f4\fs29
. Since (x, y) \u8712?\par\pard\sect\sectd\sbknone\cols2\colno1\colw1858\colsr6
0\colno2\colw9842\colsr160\ql \li770\sb1\sl-331\slmult0 \up0 \expndtw-2\charscal
ex100 A \u8712? P\ul0\sub\cf4\f5\fs30 R \up0 \expndtw-3\charscalex100 \ul0\nosup
ersub\cf6\f7\fs14 P\par\pard\ql \li432\sb66\sl-285\slmult0 \up0 \expndtw0\charsc
alex83 \ul0\nosupersub\cf3\f4\fs29 P .\par\pard\column \ql \li2506\sb0\sl-126\sl
mult0\tx5078 \up0 \expndtw0\charscalex116 \ul0\nosupersub\cf6\f7\fs14 R\tab \up0

\expndtw0\charscalex116 R\par\pard\ql \li20\sb0\sl-261\slmult0 \up0 \expndtw-2\

charscalex100 \ul0\nosupersub\cf3\f4\fs29 \u8660? A is an equivalence class of t
he relation R\ul0\sub\cf4\f5\fs30 P\ul0\nosupersub\cf3\f4\fs29 \u8660? A is a
part of the partition \par\pard\sect\sectd\sbknone \ql \li432\ri262\sb185\sl-360
\slmult0\tx770 \up0 \expndtw0\charscalex98 Example 5.5. Let V be a vector space
over R. An equivalence relation \u8764? on V is said \up0 \expndtw0\charscale
x103 to be translation preserving if u \u8764? v implies u + w \u8764? v + w for
all w \u8712? V . \line \tab \up0 \expndtw0\charscalex98 A subspace of V is a n
onempty subset H \u8834? V such that if u, v \u8712? H then au + bv \u8712? H \l
ine \up0 \expndtw0\charscalex98 for all a, b \u8712? R. \par\pard\qj \li432\ri26
1\sb0\sl-360\slmult0\fi338 \up0 \expndtw0\charscalex99 Given a subspace H \u8834
? V . The relation \u8764? on V , defined by u \u8764? v if v \u8722? u \u8712?
H , is an \up0 \expndtw0\charscalex92 order preserving equivalence relation on V
. \par\pard\ql \li5794\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb0\sl-253\slmult
0 \par\pard\ql\li5794\sb0\sl-253\slmult0 \par\pard\ql\li5794\sb30\sl-253\slmult0
\up0 \expndtw-10\charscalex94 \ul0\nosupersub\cf5\f6\fs22 13
{\shp {\*\shpinst\shpleft11178\shptop12213\shpright11178\shpbottom12023\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz965\shplid0{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop12027\shpright11351\shpbottom12027\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz969\shplid1{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11182\shptop12209\shpright11351\shpbottom12209\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz973\shplid2{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}
{\shp {\*\shpinst\shpleft11355\shptop12213\shpright11355\shpbottom12023\shpfhdr0
\shpbxpage\shpbypage\shpwr3\shpwrk0\shpfblwtxt1\shpz977\shplid3{\sp{\sn shapeTyp
e}{\sv 20}}{\sp{\sn fBehindDocument}{\sv 1}}{\sp{\sn lineColor}{\sv 0}}{\sp{\sn
lineWidth}{\sv 6010}}
}}\par\pard\sect\sectd\fs24}