Related papers: Linear complexity of Legendre-polynomial quotients

We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…

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…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

In this paper, we prove a conjecture of the second author by evaluating the determinant $$\det\left[x+\left(\frac{i-j}p\right)+\left(\frac ip\right)y+\left(\frac jp\right)z+\left(\frac{ij}p\right)w\right]_{0\le i,j\le(p-3)/2}$$ for any odd…

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

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…

A Littlewood polynomial is a polynomial in $\mathbb{C}[z]$ having all of its coefficients in $\{-1,1\}$. There are various old unsolved problems, mostly due to Littlewood and Erd\H{o}s, that ask for Littlewood polynomials that provide a…

In a series of recent works, we have provided a number of explicit expressions for the derivative of the associated Legendre function of the first kind with respect to its degree, $[\partial P_{\nu}^{m}(z)/\partial\nu]_{\nu=n}$, with…

We show that the simple modules of the Rouquier blocks of symmetric groups, in characteristic $p$ and having $p$-weight $w$ with $w < p$, have a common complexity $w$, and that when $p$ is odd, $D^{(p+1,1^{p-1})}$ has complexity 1, while…

For $f : \mathbb{N} \to \{0,\pm 1\}$ the $f$-signed partition numbers $\mathfrak{p}(n,f)$ are defined to be the weighted partition sums \[ \mathfrak{p}(n,f) = \sum_{\substack{x_{1}+\cdots+x_{k} = n \\ x_{1} \geq \cdots \geq x_{k} > 0 \\ k…

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…

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

We consider the problem of recovering a hidden monic polynomial f(X) of degree d > 0 over the finite field F of p elements given a black box which, for any x in F, evaluates the quadratic character of f(x). We design a classical algorithm…

Determinants with Legendre symbol entries have close relations with character sums and elliptic curves over finite fields. In recent years, Sun, Krachun and his cooperators studied this topic. In this paper, we confirm some conjectures…

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

We prove a priori estimates for solutions of order $2$ linear elliptic PDEs in divergence form on subanalytic domains. More precisely, we study the solutions of a strongly elliptic equation $Lu=f$, with $f\in L^2(\mathcal{\Omega})$ and…

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the…

For $0\leq \alpha<1$ and prime number $p$ let $L(\alpha,p)$ be the sum of the first $[\alpha p]$ values of Legendre symbol modulo $p$. We study positivity of $L(\alpha,p)$ and prove that for $|\alpha-\frac13|<2\cdot 10^{-6}$ and for…