BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-763
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A symmetric chain decomposition of L(4,n)
        TYPE:: Technical Report
      AUTHOR:: West, Douglas B.
        DATE:: August 1979
       PAGES:: 16
    ABSTRACT:: L(m,n) is the set of integer m-tuples ($a_1$,...,$a_m$) with
               $0\leq a_1 \leq ...\leq a_m \leq n$, ordered by
               $\underline{a} \leq \underline{b}$ when $a_i\leq b_i$ for all
               i. R. Stanley conjectured that L(m,n) is a symmetric chain
               order for all (m,n). We verify this by construction for m =
               4.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-763