Young Diagram Meet Playground

Enter two signed or p‑adic Young diagrams. The output shows witness diagrams for their meet — the greatest lower bound in the dominance order.

Diagram A

signed: comma-separated per row, values 1/−1

Controls

Diagram B

p‑adic: semicolon‑separated pairs, e.g. 1,1;−1,−1

Input A

Input B

Meet Witness A

Meet Witness B