English

A $q$-analogue of Wilson's congruence

Combinatorics 2019-04-19 v1 Number Theory

Abstract

Let Cn{\mathcal C}_n be the set of all permutation cycles of length nn over {1,2,,n}\{1,2,\ldots,n\}. Let fn(q):=σCn+1qmajσ{\mathfrak f}_n(q):=\sum_{\sigma\in{\mathcal C}_{n+1}}q^{{\mathrm maj}\,\sigma} be a qq-analogue of the factorial n!n!, where maj{\mathrm maj} denotes the major index. We prove a qq-analogue of Wilson's congruence fn1(q)μ(n)(modΦn(q)), {\mathfrak f}_{n-1}(q)\equiv\mu(n)\pmod{\Phi_n(q)}, where μ\mu denotes the M\"obius function and Φn(q)\Phi_n(q) is the nn-th cyclotomic polynomial.

Keywords

Cite

@article{arxiv.1904.08857,
  title  = {A $q$-analogue of Wilson's congruence},
  author = {Hao Pan and Yu-Chen Sun},
  journal= {arXiv preprint arXiv:1904.08857},
  year   = {2019}
}

Comments

This is a preliminary draft