4204hw9 - 4 The permutation graph (also sometimes called...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Combinatorics II (MAD 4204) — Spring 2011 Due Wednesday 4/13/11 Homework #9 1 Compute the basis and enumeration for the sum closure 1 , 21 . 2 Compute the basis and enumeration for the sum Av 21 Av 12 . 3 Prove that the permutation class C is sum closed if and only if every basis element of C is sum indecomposable.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4 The permutation graph (also sometimes called the inversion graph ) of the permutation of length n , denoted G , is the graph on n where i j if and only if i j and i j . Prove that is sum indecomposable if and only if G is connected....
View Full Document

Ask a homework question - tutors are online