Skip to main content
Bounty Ended with 50 reputation awarded by Pablo Spiga
edited body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\mu|=m$$|\lambda|+|\mu|=n$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\mu|=m$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\mu|=n$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

edited body
Source Link
darij grinberg
  • 33.8k
  • 4
  • 118
  • 253

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\nu|=m$$|\lambda|+|\mu|=m$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\nu|=m$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

Lemma. Fix $n$ and $m$. Consider pairs of partitions $(\lambda,\mu)$ such that $\lambda$ has $m$ parts and $|\lambda|+|\mu|=m$. Let $A$ be the number of pairs for which $\max(\lambda)>\max(\mu)$ (where $\max(\emptyset)=-\infty$). Let $B$ be number of pairs for which $\lambda$ satisfies this condition with Durfee square, which we may rephrase as '$\lambda_i=i$ for some $i$, where $\lambda=(\lambda_1\geqslant \lambda_2\geqslant \dots)$'. Then $A=B$.

Fixed misprint
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459

So, we choose a partition with maximal part $a_k$ (this is $\mu$) and another partition onto $m$ parts with maximal part at most $a_k$. This is $\lambda$. Also, exponent $m$ of $t$ is the number of parts in $\lambda$, and exponent of $x$ is $|\lambda|+|\nu|$$|\lambda|+|\mu|$.

So, we choose a partition with maximal part $a_k$ (this is $\mu$) and another partition onto $m$ parts with maximal part at most $a_k$. This is $\lambda$. Also, exponent $m$ of $t$ is the number of parts in $\lambda$, and exponent of $x$ is $|\lambda|+|\nu|$.

So, we choose a partition with maximal part $a_k$ (this is $\mu$) and another partition onto $m$ parts with maximal part at most $a_k$. This is $\lambda$. Also, exponent $m$ of $t$ is the number of parts in $\lambda$, and exponent of $x$ is $|\lambda|+|\mu|$.

deleted 264 characters in body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459
Loading
added 603 characters in body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459
Loading
added 1097 characters in body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459
Loading
added 1973 characters in body
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459
Loading
Source Link
Fedor Petrov
  • 108.9k
  • 9
  • 264
  • 459
Loading