A symmetric chain decomposition of N(m,n) of composition

2021/07/25 by Zhong, Yueming
#Combinatorics (math.CO) #FOS: Mathematics #Primary 05A19 #Secondary 05E99

paper · doi:10.48550/arxiv.2107.11715

Abstract

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers m and n, let N(m,n) denote the set of all compositions α=(α₁,⋯,α_m), with 0≤ α_i ≤ n for each i=1,⋯,m. Define order

Related

• Geometric Symmetric Chain Decompositions
• Symmetric chain decompositions of B_n and Pi_n
• Saturated chains in composition posets
• The number of symmetric chain decompositions
• Chain Decomposition Theorems for Ordered Sets (and Other Musings)