1
$\begingroup$

Let $$r_k(x)=\prod_{j=1}^k {(\frac{x+j}{j}})^{\min(j,k-j)}.$$

Computations suggest that $$r_{2k}(x)=\sum_{j=0}^{(k-1)^2}a(2k,j)\binom{k^2+x-j}{k^2}$$ and $$r_{2k+1}(x)=\sum_{j=0}^{k^2-k}a(2k+1,j)\binom{k^2+k+x-j}{k^2+k},$$ where the coefficients $a(k,j)$ are positive, palindromic and gamma positive. Is there an elementary proof?

$\endgroup$
0

1 Answer 1

3
$\begingroup$

Upgrading my comment to an answer. It is not hard to see that $r_k(x)$ is the same as MacMahon's famous formula for the number of plane partitions in a $\lfloor k/2 \rfloor \times \lceil k/2 \rceil \times x$ box. Then the same argument as in my previous answer (see in particular Section 3.15.2 of Stanley's EC1, which explains that $a(k,j)$ is the number of linear extensions of $[\lfloor k/2 \rfloor]\times [\lceil k/2 \rceil]$ with $j$ descents) implies the $\gamma$-positivity you are interested in.

$\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.