# Function Repository Resource:

# FrobeniusSymbolFromPartition

Get a pair of lists representing the Ferrers diagram of a partition

Contributed by: George Beck
 ResourceFunction["FrobeniusSymbolFromPartition"][λ] gives a pair of lists that count dots in the rows and columns relative to the diagonal of the Durfee square in the Ferrers diagram of the partition λ.

## Details and Options

A partition of n is a list of weakly decreasing positive integers that add up to n. For instance, written compactly, these are the five partitions of 4: 4, 31, 22, 211, 1111.
In the output of FrobeniusSymbolFromPartition, the first list represents the number of dots to the right of the diagonal in the Ferrers diagram of the given partition, and the second list represents the number of dots below the diagonal.

## Examples

### Basic Examples

Compute the Frobenius symbol of a partition:

 In:= Out= Here we use a partition of 8 consisting of only one large part:

 In:= Out= Here the partition is 11111111, with many small parts:

 In:= Out= Here is an intermediate case:

 In:= Out= ### Scope

A partition is a list of nonincreasing positive integers:

 In:= Here is its Ferrers diagram:

 In:= Out= Define a function to illustrate the definition of the Frobenius symbol: The number of dots in the rows to the right of the diagonal is 6, 5, 1. The number of dots in the columns below the diagonal is 4, 2, 0:

 In:= Out= These lists are the rows of the Frobenius symbol of the partition:

 In:= Out= Here is another example:

 In:= In:= Out= In:= Out= ### Properties and Relations

Confirm that Frobenius symbols and partitions round trip as expected:

 In:= Out= In:= Out= ## Requirements

Wolfram Language 11.3 (March 2018) or above