Math 2.0

definition

Young diagram

Definition

A Young diagram is a finite set D⊆N×ND \subseteq \mathbb{N} \times \mathbb{N} with this property: if (i,j)∈D(i, j) \in D, i′≤ii' \le i and j′≤jj' \le j, then (i′,j′)∈D(i', j') \in D. The elements of DD are the cells, or boxes, of the diagram. A cell (i,j)(i, j) is drawn as a unit square in row ii and column jj, with rows numbered from the top.

Remarks

The rows of a Young diagram have weakly decreasing lengths λ1≥λ2≥…\lambda_1 \ge \lambda_2 \ge \dots. Thus a Young diagram with nn cells is the same as a partition of nn. This drawing convention is the English one. The French convention draws row 00 at the bottom. Transposing a diagram, (i,j)↦(j,i)(i, j) \mapsto (j, i), gives the diagram of the conjugate partition.

Explanations

L1 human

A Young diagram draws a partition as rows of boxes, left-aligned, with the longest row at the top. The partition 4+2+14 + 2 + 1 gives rows of 44, 22 and 11 boxes.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Integer partition definition
  2. Young diagram definition

Sources

  1. Web https://en.wikipedia.org/wiki/Young_tableau, Diagrams