Generalized specialized q,t-rectangle formula

For a,b0a,b\geq 0, write b=bkb=b'k and a=aka=a'k for integers a,b,k0a',b',k\geq 0 with gcd(a,b)=1\gcd(a',b')=1, and let Sa,b(q,t)S_{a,b}(q,t) be the q,t-rectangle number. Let [j]qk[j]_{q^k} denote the q-integer with base qkq^k, and let [a+ba,b]q\genfrac{[}{]}{0pt}{}{a+b}{a,b}_q be the q-multinomial coefficient. Generalized specialized q,t-rectangle formula.

qk(a1)(b1)/2+ab(k2)Sa,b(q,1/q)=a+b[a+b]qk[a+ba,b]q.q^{k(a'-1)(b'-1)/2+a'b'\binom{k}{2}}S_{a,b}(q,1/q)=\frac{a'+b'}{[a'+b']_{q^k}}\genfrac{[}{]}{0pt}{}{a+b}{a,b}_q.

This extends the preceding specialized formula from rectangles with dimensions nn and mnmn to arbitrary rectangles, with the common-factor decomposition controlling the exponent and denominator.

Sources & referencesView supporting material

Primary source

Drew Armstrong, Nicholas A. Loehr and Gregory S. Warrington, “Sweep maps: A continuous family of sorting algorithms”, arXiv:1406.1196 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.