Related papers: Linear complexity of Legendre-polynomial quotients

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…

For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with…

In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field $\mathbb{Z}_p$ and over a polynomial ring $\mathbb{F}[x_1,\ldots,x_t]$. We reduce solving general linear systems in…

An established measure of the expressive power of a given ReLU neural network is the number of linear regions into which it partitions the input space. There exist many different, non-equivalent definitions of what a linear region actually…

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

We study the existence of solutions of the Dirichlet problem {gather} -\phi_p(u')' -a_+ \phi_p(u^+) + a_- \phi_p(u^-) -\lambda \phi_p(u) = f(x,u), \quad x \in (0,1), \label{pb.eq} \tag{1} u(0)=u(1)=0,\label{pb_bc.eq} \tag{2} {gather} where…

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

We provide closed-form expressions for the degree-derivatives $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=n}$ and $[\partial Q_{\nu}(z)/\partial\nu]_{\nu=n}$, with $z\in\mathbb{C}$ and $n\in\mathbb{N}_{0}$, where $P_{\nu}(z)$ and…

In this paper we propose a general strategy for rapidly computing sparse Legendre expansions. The resulting methods yield a new class of fast algorithms capable of approximating a given function $f:[-1,1] \rightarrow \mathbb{R}$ with a…

Double integrals that represent matrix elements of the power and logarithmic potentials in the Legendre polynoiomial basis on [-1,1] are found in a closed form. Several proofs are given, which involve different special functions and…

Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years.…

We describe two methods for computing $p$-modular Brauer character tables for groups of Lie type $G(p^f)$ in defining characteristic $p$, assuming that the ordinary character table of $G(p^f)$ is known, and the weight multiplicities of the…

We call the \emph{$p$-fundamental string} of a complex simple Lie algebra to the sequence of irreducible representations having highest weights of the form $k\omega_1+\omega_p$ for $k\geq0$, where $\omega_j$ denotes the $j$-th fundamental…

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a…

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

We study the fractional $(p,q)$-Laplace equation $$ (-\Delta_p)^s u +(-\Delta_q)^t u= 0 $$ for $s,t\in(0,1)$ and $p,q\in(1,\infty)$. We establish H\"older estimates with an explicit exponent. As a consequence, we derive a Liouville-type…

The Frobenius method can be used to represent solutions of ordinary differential equations by (generalized) power series. It is useful to have prior knowledge of the coefficients of this series. In this contribution we demonstrate that the…

The primary objective of this section is to demonstrate that the actual pseudorandom measures of our construction are significantly smaller than the theoretical upper bounds derived from the Weil theorem. Regarding the family of sequences,…

The derivative of the associated Legendre function of the first kind of integer degree with respect to its order, $\partial P_{n}^{\mu}(z)/\partial\mu$, is studied. After deriving and investigating general formulas for $\mu$ arbitrary…