In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.
In light of the well-known fact that the $n$th divided difference of any polynomial of degree $m$ must be zero while $m<n$,the present paper proves the $(alpha,beta)$-inversion formula conjectured by Hsu and Ma [J. Math. Res. $&$ Exposition 25(4) (2005) 624]. As applications of $(alpha,beta)$-inversion, we not only recover some known matrix
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function methodology of modern enumerative combinatorics and their applications to computational problems.
In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}equiv (2q+2q^{-1}-1)[n]_{q^2}^4pmod{[n]_{q^2}^4Phi_n(q^2)}, $$ where $[n]=[n]_q=(1-q^n)/(1-q),(a;q)_0=1,(a;q)_k=(1-a)(1-aq)cdots(1-aq^{k-1})$ for $kgeq 1$ and $Phi_n(q)$ denotes the $n$-th cyclotomic polynomial.
We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and dual Grothendieck polynomials.
Based on a bijection between domino tilings of an Aztec diamond and non-intersecting lattice paths, a simple proof of the Aztec diamond theorem is given in terms of Hankel determinants of the large and small Schroder numbers.