06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

64 3. Distribution Problems<br />

Problem 160. Explain the relationship between partitions of k into n parts<br />

and lists x 1 , x 2 ,..., x n of positive integers that add to k with x 1 ≥ x 2 ≥<br />

... ≥ x n . Such a representation of a partition is called a decreasing list<br />

representation of the partition.<br />

◦ Problem 161. Describe the relationship between partitions of k and lists or<br />

vectors (x 1 , x 2 ,...,x n ) such that x 1 +2x 2 +...kx k = k. Such a representation<br />

of a partition is called a type vector representation of a partition, and it is<br />

typical to leave the trailing zeros out of such a representation; for example<br />

(2, 1) stands for the same partition as (2, 1, 0, 0). What is the decreasing list<br />

representation for this partition, and what number does it partition?<br />

Problem 162. How does the number of partitions of k relate to the number<br />

of partitions of k +1whose smallest part is one? (h)<br />

When we write a partition as λ = λ 1 ,λ 2 ,...,λ n , it is customary to write the list<br />

of λ i s as a decreasing list. When we have a type vector (t 1 , t 2 ,...,t m ) for a partition,<br />

we write either λ =1 t 1<br />

2 t2 ···m t m<br />

or λ = m t m<br />

(m − 1) t m−1<br />

···2 t 2<br />

1 t 1<br />

. Henceforth we<br />

will use the second of these. When we write λ = λ i 1<br />

1<br />

λ i 2<br />

2 ···λ i n<br />

n , we will assume that<br />

λ i >λ i+1 .<br />

3.3.3 Ferrers and Young Diagrams and the conjugate of a partition<br />

The decreasing list representation of partitions leads us to a handy way to visualize<br />

partitions. Given a decreasing list (λ 1 ,λ 2 ,...λ n ), we draw a figure made up of<br />

rows of dots that has λ 1 equally spaced dots in the first row, λ 2 equally spaced dots<br />

in the second row, starting out right below the beginning of the first row and so on.<br />

Equivalently, instead of dots, we may use identical squares, drawn so that a square<br />

touches each one to its immediate right or immediately below it along an edge.<br />

See Figure 3.3.1 for examples. The figure we draw with dots is called the Ferrers<br />

diagram of the partition; sometimes the figure with squares is also called a Ferrers<br />

diagram; sometimes it is called a Young diagram. At this stage it is irrelevant<br />

which name we choose and which kind of figure we draw; in more advanced work<br />

the squares are handy because we can put things like numbers or variables into<br />

them. From now on we will use squares and call the diagrams Young diagrams.<br />

Figure 3.3.1: The Ferrers and Young diagrams of the partition (5,3,3,2)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!