Scribd Logo
Upload

Welcome to Scribd!

  • 69 views

    Ferrers Graphs

    Uploaded by

    A Fry
    Ferrers graphs are a visual method of representing partitions as rows of dots stacked on top of each other, with each row representing a part of the partition. This makes relationships between partitions, such as conjugates and self-conjugates, easier to see compared to numeric representations. Ferrers graphs also allow forming bijections between sets of partitions and seeing that the number of all partitions is odd if and only if the number of self-conjugate partitions is odd.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Ferrers Graphs

    Uploaded by

    A Fry
    69 views5 pages
    Ferrers graphs are a visual method of representing partitions as rows of dots stacked on top of each other, with each row representing a part of the partition. This makes relationships between partitions, such as conjugates and self-conjugates, easier to see compared to numeric representations. Ferrers graphs also allow forming bijections between sets of partitions and seeing that the number of all partitions is odd if and only if the number of self-conjugate partitions is odd.

    Original Description:

    .

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Ferrers graphs are a visual method of representing partitions as rows of dots stacked on top of each other, with each row representing a part of the partition. This makes relationships between partitions, such as conjugates and self-conjugates, easier to see compared to numeric representations. Ferrers graphs also allow forming bijections between sets of partitions and seeing that the number of all partitions is odd if and only if the number of self-conjugate partitions is odd.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    69 views5 pages

    Ferrers Graphs

    Uploaded by

    A Fry
    Ferrers graphs are a visual method of representing partitions as rows of dots stacked on top of each other, with each row representing a part of the partition. This makes relationships between partitions, such as conjugates and self-conjugates, easier to see compared to numeric representations. Ferrers graphs also allow forming bijections between sets of partitions and seeing that the number of all partitions is odd if and only if the number of self-conjugate partitions is odd.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 5

    Ferrers Graphs

    • A method of visualising partitions as a diagram made up of rows of dots stacked on top of


    each other
    • Each row represents one part of the partition

    14 = 6 + 6 + 1 + 1 = 8 + 3 + 2 + 1 =4+3+3+3+1
    • Often make seeing relationships between sets of partitions easier to see

    (13)
    (14|at least one part of size 1)

    • This can make forming bijections more straightforward

    ………..
    ……….. (n-1)
    (n|at least one part of size 1)
    ...
    • Ferrers graphs allow us to easily see conjugate partitions by transposing

    • This can be hard to see from the summation notation for partitions

    6+6+1+1 = 4+2+2+2+2+2
    • Sometimes transposing produces the same graph

    • These are called self-conjugates

    • As with conjugates, self-conjugates are not immediately obvious in the summation form

    4+2+1+1
    • As with other conditions, we can form bijections between sets involving conjugate and self-
    conjugate partitions or find relationships between partitions that involve conjugates and
    self-conjugates

    • p(n) is odd iff p(n|self-conjugates) is odd

    • From the Ferrers graphs we can see that all partitions that are conjugate match up to
    another unique partition for n

    • Only self-conjugate partitions are left unpaired

    • Therefore, p(n) can be odd only if there are an odd number of self-conjugate partitions

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy