Binomial and factorial congruences for \(\mathbb F_q[t]\) (Q765800)

Among the analogies between number fields and function fields over finite fields we have the theme of congruences satisfied by binomial coefficients and factorials modulo primes in both settings: rational primes and irreducible polynomials. In this context, the author looks at the factorial or the binomial coefficient ``\(n\) choose \(m\)''. Though the values are in a function field, \(n\) and \(m\) can be chosen to be usual integers, polynomials or mixed. In this way, the author obtains several interesting analogues of, among others, the theorems of Lucas and Wilson with several generalizations and different proofs. Also, the author presents several open questions. The paper is organized as follows. In Section 2 multiple analogues of factorials and binomial coefficients, are established. In Section 3, several results of Lucas type are proved. For instance, it is shown that if \({\mathfrak p}\) is a prime of \({\mathbb F}_q[T]\), then \(\left[ \begin{matrix} a\cr b\end{matrix} \right] \equiv \prod \left[ \begin{matrix} a_i\cr b_i\end{matrix} \right] \bmod {\mathfrak p}\) where \(a=\sum a_i {\mathfrak p}^i\) and \(b=\sum b_i {\mathfrak p}^i\). Section 4 deals with Wilson's type results. For instance, it is proved that \(({\mathcal N} {\mathfrak p}-1)!\equiv (-1)^{d-1}\bmod {\mathfrak p}\). In Section 6 the author studies refined Wilson's theorems. Section 7 is about congruences modulo prime powers. In Section 8 Bernoulli numbers are considered. In the last section the author presents several questions to be considered for further research.