2
$\begingroup$

Fix natural numbers $n,m\in\mathbb{N}$. Given a partition $\lambda\vdash d$ with at most $n$ rows (and at most $m$ columns), we can define a partition $\lambda^\ast=(\lambda^\ast_1,\ldots,\lambda^\ast_n)$ by setting $\lambda^\ast_i:=m-\lambda_{n+1-i}$. Graphically, it is obtained by taking the complement of the Young diagram of $\lambda$ inside the $n\times m$ $-$ box $(m^n)$. Now, I'd be curious to learn about any combinatorial results involving this construction - but I don't know what it is called. If someone could tell me, that would be great - this way I'd not have such a hard time searching.

$\endgroup$
1
  • 3
    $\begingroup$ I've heard both "reverse partition" and "complementary partition" used to describe this. $\endgroup$ May 24, 2012 at 8:10

1 Answer 1

1
$\begingroup$

The "right" answer was given by Gjergji Zaimi in his comment above: Both "reverse partition" and "complementary partition" are terms that seem to be in use.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.