Some determinants involving binary forms

Arithmetic functions; related numbers; inversion formulas (11A25) Matrices, determinants in number theory (11C20) Polynomials over finite fields (11T06) Determinants, permanents, traces, other special matrix functions (15A15)

Review text

Let \(c,d\in\mathbb{Z}\). For any odd \(n>1\) the authors show that if \((\frac{d}{n})=-1\), then the value of the determinant\N\[\N\det \left[ \left(\frac{i^2+cij+dj^2}{n}\right)\right]_{0\le i,j\le n-1}\N\]\Nis divisible by \(\varphi(n)^2\), where \(\varphi\) is Euler's totient function, and \((\frac{\cdot}{\cdot})\) refers to the Jacobi symbol. Also, they prove that if \(p\) is an odd prime, and \(H(x,y)=\sum_{k=0}^{n}a_kx^ky^{n-k}\) with \(a_0,\ldots,a_n\in\mathbb{Z}\), then, if \(n=p-1\), one has\N\[\N\det[x+H(i,j)]_{1\le i,j\le p-1}\equiv(x+a_0+a_{p-1})\prod_{k=1}^{p-2}a_k\pmod{p},\N\]\Nand if \(n=p-2\) or \(p-1<n<2p-2\),\N\[\N\det[x+H(i,j)]_{1\le i,j\le p-1}\equiv(-1)^n\prod_{k=0}^{p-2}\sum_{\substack{0\le j\le n\\ p-1\mid j-k}}a_j\pmod{p}.\N\]\NAs a corollary, they deduce that if \(p>3\) is a prime and \(n\in\{(p+1)/2,\ldots,p-2\}\), then \(\det[x+(i^2+cij+dj^2)^n]_{1\le i,j\le p-1}\) modulo \(p\) is independent of \(x\). Furthermore, the authors show that if \(p>3\) is a prime, and \(P(t)=\sum_{k=0}^{p-2}a_kt^k\) with \(a_0,\ldots,a_{p-2}\in\mathbb{Z}_p\), then\N\[\N\det \left[P(ij^{-1})\right]_{1<i,j<p-1}\equiv 4\sum_{i=0}^{(p-3)/{2}}\hat{a}_{2i}\times\sum_{i=0}^{(p-3)/{2}}\hat{a}_{2i+1}\pmod{p},\N\]\Nwhere for \(k=0,\ldots,p-2\) the values of \(\hat{a}_k\) is given by\N\[\N\hat{a}_k=\prod_{\substack{0\le j\le p-2 \\ 2\mid j-k, j\neq k}}a_j.\N\]\NAs a corollary to this result, they evaluate modulo prime \(p>3\) of \(\det [(i^2+ij+j^2)^{p-2}]_{1<i,j<p-1}\) in several cases.

Cites work

This page was built for publication: Some determinants involving binary forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952162)