Evaluation of two determinants involving $q$-integers

TL;DR

This paper derives explicit formulas for determinants involving q-integers using discrete Fourier transforms, revealing connections with Jacobi symbols and q-exponentials.

Contribution

It introduces novel determinant identities involving q-integers and provides proofs via discrete Fourier transforms, expanding the understanding of q-analogues in combinatorics.

Findings

Explicit determinant formulas involving q-integers and Jacobi symbols

Connections between q-analogues and Fourier analysis methods

New identities for determinants with floor and ceiling functions

Abstract

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities: $$\det\left[\left[\left\lfloor\frac{aj-(a+1)k}n\right\rfloor\right]_q\right]_{1\leqslant j,k\leqslant n}=-\left(\frac{a(a+1)}n\right)q^{(1-3n)/2}$$ and $$\det\left[\left[\left\lceil\frac{(a+1)j-ak}n\right\rceil\right]_q\right]_{1\leqslant j,k\leqslant n}=\left(\frac{a(a+1)}n\right)q^{(n-1)/2},$$ where $(\frac{\cdot}n)$ denotes the Jacobi symbol.