【计算机中的数学笔记3】Ordering

1. DEFINITION

Let S be a set.

Let  be a relation.

R is reflective if .

R is transitive if 

R is anti-symmetric if 

Then, R is an ordering.

Linear Ordering/Total Ordering: 

(vs. Partial Ordering)

2. Hasse Diagram: containing immediate predecessor, unique for finite set

x is the immediate predecessor of y if:

3. Further Definition

1) comparable, incomparable

2) maximal: 

maximum: 

usually not the same if it's not a linear ordering.

3)induced sub-ordering

4.Mirsky's Theorem: max size of chains = min size of anti-chains

height: largest chain

width: largest anti-chain

height(S) is the minimum t such that we can partition S into t anti-chains:

OR: S can be partitioned into t anti-chains, if and only if every chain has size at most t. 

5.Dilworth Theorem: max size of anti-chains = min size of chains

6.Applicaiton

Corollay: height(S)*width(S)>=|S|

1, 3, 2, 8, 6, 4, 13, 7, 9

Theorem: There's one increasing-subsequence of at least sqrt(n) size, or a decreasing-subsequence of at least sqrt(n) size.