The evaluations of determinants with Legendre symbol entries have close relation with character sums over finite fields. Recently, Sun posed some conjectures on this topic. In this paper, we prove some conjectures of Sun and also study some variants. For example, we show the following result:
Let $p=a^2+4b^2$ be a prime with $a,b$ integers and $a\equiv1\pmod4$. Then for the determinant $$S(1,p):={\rm det}\bigg[\left(\frac{i^2+j^2}{p}\right)\bigg]_{1\le i,j\le \frac{p-1}{2}},$$ the number $S(1,p)/a$ is an integral square, which confirms a conjecture posed by Cohen, Sun and Vsemirnov.
For each positive integer $r$, we construct a nowhere-vanishing, single-cuspidal Drinfeld modular form for $\GL_r(\FF_q[θ])$, necessarily of least possible weight, via determinants using rigid analytic trivializations of the universal Drinfeld module of rank $r$ and deformations of vectorial Eisenstein series. Along the way, we deduce that the cycle class map from de Rham cohomology to Betti cohomology is an isomorphism for Drinfeld modules of all ranks over $\FF_q[θ]$.
In this paper we mainly focus on some determinants with Legendre symbol entries. Let $p$ be an odd prime and let $(\frac{\cdot}p)$ be the Legendre symbol. We show that $(\frac{-S(d,p)}p)=1$ for any $d\in\mathbb Z$ with $(\frac dp)=1$, and that $$\left(\frac{W_p}p\right)=\begin{cases}(-1)^{|\{0<k<\frac p4:\ (\frac kp)=-1\}|}&\text{if}\ p\equiv1\pmod4, \\(-1)^{\lfloor(p+1)/8\rfloor}&\text{if}\ p\equiv3\pmod4,\end{cases}$$ where $$S(d,p)=\det\left[\left(\frac{i^2+dj^2}p\right)\right]_{1\le i,j\le(p-1)/2}$$ and $$W_p=\det\left[\left(\frac{i^2-((p-1)/2)!j}p\right)\right]_{0\le i,j\le(p-1)/2}.$$ We …
I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to the new infinite hierarchies of q-series identities by means of the special case of Bailey's lemma. Some of the identities of Ramanujan, Slater, McLaughlin and Sills are obtained this way.
In this article we estimate the number of integers up to $X$ which can be represented by a positive-definite, binary integral quadratic form of discriminant which is small relative to $X$. This follows from understanding the vector of signs when computing the Legendre symbol of small integers $n$ at multiple primes.
For $0\leq α<1$ and prime number $p$ let $L(α,p)$ be the sum of the first $[αp]$ values of Legendre symbol modulo $p$. We study positivity of $L(α,p)$ and prove that for $|α-\frac13|<2\cdot 10^{-6}$ and for rational $α\leq \frac12$ with denominators in the set $\{1,2,3,4,5,6,8,12\}$ the inequality $L(α,p)\geq 0$ holds for majority of primes.
We announce a very general statement involving the rational quartic residue symbol $(m/p)_4$ and, more generally, Legendre symbols of the type ${a+b\sqrt{m}/p$. We show how our main theorem can be used to produce many older results such as Scholz's, Lehmer's or Burde's reciprocity laws and many others. It is very likely that all existing reciprocity laws of this type can be obtained from our result. This is a corrected and improved version of version 2.
On a determinant involving linear combinations of Legendre symbols
School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University（西安利物浦大学数学与物理学院）；School of Mathematics, Nanjing University（南京大学数学系）；School of Physical and Mathematical Sciences, Nanjing Tech University（南京工业大学物理与数学科学学院）
Let $m$ be any positive integer and let $δ_1,δ_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=δ_1\ \quad\text{and}\ \quad\left(\frac{p_{n+j}}{p_{n+i}}\right)=δ_2$$ for all $0\le i<j\le m$, where $p_k$ denotes the $k$-th prime, and $(\frac {\cdot}p)$ denotes the Legendre symbol for any odd prime $p$. We also prove that under the Generalized Riemann Hypothesis there are infinitely many positive integers $n$ such that $p_{n+i}$ is a primitive root modulo $p_{n+j}$ for any di…
The restricted isometry property (RIP) is an important matrix condition in compressed sensing, but the best matrix constructions to date use randomness. This paper leverages pseudorandom properties of the Legendre symbol to reduce the number of random bits in an RIP matrix with Bernoulli entries. In this regard, the Legendre symbol is not special---our main result naturally generalizes to any small-bias sample space. We also conjecture that no random bits are necessary for our Legendre symbol--based construction.
Let $p>3$ be a prime. We investigate Legendre symbol of $\displaystyle \prod_{0<i<j<p/2 \atop p\nmid f(i,j) } f(i,j) \ $, where $i,j\in \Bbb Z, f(i,j)$ is a linear or quadratic form with integer coefficients. When $f=ai^2+bij+cj^2$ and $p\nmid c(a+b+c)$ , we prove that to evaluate the product is equivalent to determine $ \displaystyle \sum_{y=1}^{p-1} \bigg(\frac{y(y+1)(y+k)}{p}\bigg) \pmod{16}$ , where $4c(a+b+c)k \equiv (4ac-b^2)\pmod{p}.$ Parallel results are given for $\displaystyle \prod_{i,j=1 \atop p\nmid f(i,j) }^{(p-1)/2} \bigg(\frac{ f(i,j) }{p}\bigg).$ Then we show that $ \displayst…
Suppose that $p$ is an odd prime and $\genfrac{(}{)}{}{}{\cdot}{p}$ denotes the Legendre symbol modulo $p$. If $p$ is has the form $p= n^2+1$ then one easily verifies that $\genfrac{(}{)}{}{}{a}{p} = \genfrac{(}{)}{}{}{-a}{p}$ for all $a\in \mathbb Z/p\mathbb Z$. We identify various symmetry properties of sequential matrices over $\mathbb Z/(n^2+1)\mathbb Z$ regardless of whether $n^2+1$ is prime. We deduce from these results a collection of symmetries involving Jacobi symbol modulo $n^2+1$ which generalize our above observation on the Legendre symbol.
Large sieve inequality for sums of Legendre symbols over short intervals
Université Jean Monnet, Centrale Lyon, INSA Lyon, Université Claude Bernard Lyon 1, CNRS, ICJ UMR5208（让·莫内大学、里昂中央理工学院、里昂国立应用科学学院、里昂第一大学、法国国家科学研究中心、ICJ UMR5208）；School of Mathematics and Statistics, University of New South Wales（新南威尔士大学数学与统计学院）；Department of Mathematics, University of Bristol（布里斯托大学数学系）；School of Mathematical Sciences, Shanghai Jiao Tong University（上海交通大学数学科学学院）
In this paper we study some conjectures on determinants with Jacobi symbol entries posed by Z.-W. Sun. For any positive integer $n\equiv3\pmod4$, we show that $$(6,1)_n=[6,1]_n=(3,2)_n=[3,2]_n=0$$ and $$(4,2)_n=(8,8)_n=(3,3)_n=(21,112)_n=0$$ as conjectured by Sun, where $$(c,d)_n=\bigg|\left(\frac{i^2+cij+dj^2}n\right)\bigg|_{1\le i,j\le n-1}$$ and $$[c,d]_n=\bigg|\left(\frac{i^2+cij+dj^2}n\right)\bigg|_{0\le i,j\le n-1}$$ with $(\frac{\cdot}n)$ the Jacobi symbol. We also prove that $(10,9)_p=0$ for any prime $p\equiv5\pmod{12}$, and $[5,5]_p=0$ for any prime $p\equiv 13,17\pmod{20}$, which we…
One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be interesting to model this residue bias as a "random" walk using Legendre symbol values as steps. Such a model would allow us to easily visualize the bias. In addition, we would be able to extend our model to other number fields. In this report, we first outline underlying theory and some motivations for our research. In the second section, we present our findi…
Let $p>3$ be a prime and $m,n\in\Bbb Z$ with $p\nmid mn$. Built on the work of Morton, in the paper we prove the uniform congruence: $$&\sum_{x=0}^{p-1}\Big(\frac{x^3+mx+n}p\Big) \equiv {-(-3m)^{\frac{p-1}4} \sum_{k=0}^{p-1}\binom{-\frac 1{12}}k\binom{-\frac 5{12}}k (\frac{4m^3+27n^2}{4m^3})^k\pmod p&\t{if $4\mid p-1$,} \frac{2m}{9n}(\frac{-3m}p)(-3m)^{\frac{p+1}4} \sum_{k=0}^{p-1}\binom{-\frac 1{12}}k\binom{-\frac 5{12}}k (\frac{4m^3+27n^2}{4m^3})^k\pmod p&\text{if $4\mid p-3$,}$$ where $(\frac ap)$ is the Legendre symbol. We also establish many congruences for $x\pmod p$, where $x$ is given …
In this paper we confirm three conjectures of Z.-W. Sun on determinants. We first show that any odd integer $n>3$ divides the determinant $$\left|(i^2+dj^2)\left(\frac{i^2+dj^2}n\right)\right|_{0\le i,j\le (n-1)/2},$$ where $d$ is any integer and $(\frac{\cdot}n)$ is the Jacobi symbol. Then we prove some divisibility results concerning $|(i+dj)^n|_{0\le i,j\le n-1}$ and $|(i^2+dj^2)^n|_{0\le i,j\le n-1}$, where $d\not=0$ and $n>2$ are integers. Finally, for any odd prime $p$ and integers $c$ and $d$ with $p\nmid cd$, we determine completely the Legendre symbol $(\frac{S_c(d,p)}p)$, where $S_c(…
We continue to investigate binary sequence $(f_u)$ over $\{0,1\}$ defined by $(-1)^{f_u}=\left(\frac{(u^w-u^{wp})/p}{p}\right)$ for integers $u\ge 0$, where $\left(\frac{\cdot}{p}\right)$ is the Legendre symbol and we restrict $\left(\frac{0}{p}\right)=1$. In an earlier work, the linear complexity of $(f_u)$ was determined for $w=p-1$ under the assumption of $2^{p-1}\not\equiv 1 \pmod {p^2}$. In this work, we give possible values on the linear complexity of $(f_u)$ for all $1\le w<p-1$ under the same conditions. We also state that the case of larger $w(\geq p)$ can be reduced to that of $0\leq…
Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper we solve some conjectures of Z.W. Sun concerning $\sum_{k=0}^{p-1}\binom{2k}k^3/m^k\pmod{p^2}$, $\sum_{k=0}^{p-1}\binom{2k}k\b{4k}{2k}/m^k\pmod p$ and $\sum_{k=0}^{p-1}\binom{2k}k^2\b{4k}{2k}/m^k\pmod {p^2}.$ In particular, we show that $\sum_{k=0}^{\frac{p-1}{2}}\binom{2k}k^3\equiv 0\pmod {p^2}$ for $p\equiv 3,5,6\pmod 7$. Let $P_n(x)$ be the Legendre polynomials. In the paper we also show that $ P_{[\frac {p}{4}]}(t)\equiv -\big(\frac{-6}{p}\big)\sum_{x=0}^{p-1} \big(\frac{x^3-3/2(3t+5)x-9t-7}{p}\big)\pmod p$ and d…
Let $p>3$ be a prime, and let $R_p$ be the set of rational numbers whose denominator is coprime to $p$. Let $\{P_n(x)\}$ be the Legendre polynomials. In this paper we mainly show that for $m,n,t\in R_p$ with $m\not\e 0\pmod p$, $$\align &P_{[\frac p6]}(t) \e -\Big(\frac 3p\Big)\sum_{x=0}^{p-1}\Big(\frac{x^3-3x+2t}p\Big)\pmod p, &\Big(\sum_{x=0}^{p-1}\Big(\frac{x^3+mx+n}p\Big)\Big)^2\equiv \Big(\frac{-3m}p\Big) \sum_{k=0}^{[p/6]}\binom{2k}k\binom{3k}k\binom{6k}{3k} \Big(\frac{4m^3+27n^2}{12^3\cdot 4m^3}\Big)^k\pmod p,$$ where $(\frac ap)$ is the Legendre symbol and $[x]$ is the greatest integer…
For each odd prime $p$, let $ζ_p$ denote a primitive $p$-th root of unity. In this paper, we study the determinants of some matrices with cyclotomic unit entries. For instance, we show that when $p\equiv 3\pmod4$ and $p>3$ the determinant of the matrix $\(\frac{1-ζ_p^{j^2k^2}}{1-ζ_p^{j^2}}\)_{1\le j,k\le (p-1)/2}$ can be written as $(-1)^{\frac{h(-p)+1}{2}}(a_p+b_pi\sqrt{p})$ with $a_p,b_p\in\frac12\Z$ and $$\begin{cases}ν_p(a_p)=ν_p(b_p)=\frac{p-3}{8}&\mbox{if}\ p\equiv 3\pmod8, \\ν_p(a_p)=ν_p(b_p)+1=\frac{p+1}{8}&\mbox{if}\ p\equiv 7\pmod8,\end{cases}$$ where $ν_p(x)$ denotes the $p$-adic or…
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear to fit into the framework of the Hidden Subgroup Problem. The classical complexity of the problem is unknown despite the various results on the irregularity of Legendre Sequences.
