Related papers: Linear complexity of Legendre-polynomial quotients

Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period $p^r$ was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0408-7). Later, for the case $f$ being…

Let $p$ be an odd prime. For any $b,c\in\mathbb{Z}$, Z.-W. Sun introduced the new-type determinant $$D_p(b,c)=|(i^2+bij+cj^2)^{p-2}|_{1\leqslant i,j\leqslant p-1},$$ and studied its arithmetic properties. In this paper we mainly prove that…

We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We consider Bernoulli measures $\mu_p$ on the interval $[0,1]$. For the standard Lebesgue measure the digits $0$ and $1$ in the binary representation of real numbers appear with an equal probability $1/2$. For the Bernoulli measures, the…

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

We compute the Frobenius complexity for the determinantal ring of prime characteristic $p$ obtained by modding out the $2 \times 2$ minors of an $m \times n$ matrix of indeterminates, where $m > n \ge 2$. We also show that, as $p \to…

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…

We derive explicit expressions for the parameter derivatives $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=0}$ and $[\partial^{3}P_{\nu}(z)/\partial\nu^{3}]_{\nu=0}$, where $P_{\nu}(z)$ is the Legendre function of the first kind. It is…

In this paper, the linear complexity over $\mathbf{GF}(r)$ of generalized cyclotomic quaternary sequences with period $2pq$ is determined, where $ r $ is an odd prime such that $r \ge 5$ and $r\notin \lbrace p,q\rbrace$. The minimal value…

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…

Let $p$ be an odd prime. For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\ldots,n\}$ is said to be a Legendre cordial labeling modulo $p$ if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by $f_p^*…

We determine the exact values of the linear complexity of 2p-periodic quaternary sequences over Z_4 (the residue class ring modulo 4) defined from the generalized cyclotomic classes modulo 2p in terms of the theory of of Galois rings of…

We explore integrals of products of Legendre polynomials with a logarithmic weight function. More precisely, for Legendre polynomials $P_m$ and $P_n$ of orders $m$ and $n$, respectively, we provide simple derivations of the integrals $$\int…

We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing…

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

We study the Frobenius complexity of Hibi rings over fields of characteristic $p > 0$. In particular, for a certain class of Hibi rings (which we call $\omega^{(-1)}$-level), we compute the limit of the Frobenius complexity as $p…

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative integers such that for any pair of vertices $(u,v),|f (u) - f (v)| \ge p$ if $u$ and $v$ are adjacent, and $f(u) \neq f(v)$…