A factorial-ratio q-congruence for powers of an odd integer

About 3 years old · traced to

Let n≡1  (mod⁡4)n\equiv1\;\allowbreak(\operatorname{mod}4) be an integer greater than 11, and let r,sr,s be positive integers with r>sr>s. For (a;q)k(a;q)_k the q-shifted factorial, the factorial-ratio conjecture asserts

(q;q2)(nr−1)/4(q2n;q2n)(nr−1−1)/4(q2;q2)(nr−1)/4(qn;q2n)(nr−1−1)/4≡(q;q2)(ns−1)/4(q2n;q2n)(ns−1−1)/4(q2;q2)(ns−1)/4(qn;q2n)(ns−1−1)/4  (mod⁡Φns(q)2).\frac{(q;q^2)_{(n^r-1)/4}(q^{2n};q^{2n})_{(n^{r-1}-1)/4}}{(q^2;q^2)_{(n^r-1)/4}(q^n;q^{2n})_{(n^{r-1}-1)/4}} \equiv \frac{(q;q^2)_{(n^s-1)/4}(q^{2n};q^{2n})_{(n^{s-1}-1)/4}}{(q^2;q^2)_{(n^s-1)/4}(q^n;q^{2n})_{(n^{s-1}-1)/4}} \;\allowbreak(\operatorname{mod}\Phi_{n^s}(q)^2).

The source presents this as a conjectural q-congruence that would imply the strengthening of Lemma 3; no resolution is given.

References

Primary source

Victor J. W. Guo, “Dwork-type q-congruences through the q-Lucas theorem”, arXiv:2310.15207 (2023).

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.