Related papers: Linear complexity of Legendre-polynomial quotients

Let $p=2n+1$ be an odd prime. In this paper, we mainly evaluate determinants involving $(\frac {j+k}p)\pm(\frac{j-k}p)$, where $(\frac{\cdot}p)$ denotes the Legendre symbol. When $p\equiv1\pmod4$, we determine the characteristic polynomials…

In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions $P_\nu^{-\mu}$ and $Q_\nu^{-\mu}$ of degrees $0 \leq \nu \leq 1,000,000$ and orders $-\nu \leq \mu \leq \nu$ on the interval…

Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teuli\'e asked whether $\inf_{q \ge 1} \, q \cdot || q \alpha || \cdot |…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Let $p>3$ be a prime, and let $d\in\mathbb Z$ with $p\nmid d$. For the determinants $$S_m(d,p)=\det\left[(i^2+dj^2)^{m}\right]_{1\leqslant i,j \leqslant (p-1)/2}\ \ \left(\frac{p-1}2\leqslant m\leqslant p-1\right),$$ Sun recently determined…

Despite their simple definition as $\mathfrak{q}_p(b):=\frac{b^{p-1}-1}{p} \pmod p$, for $0\le b \le p^2-1$ and $\gcd(b,p)=1$, and their regular arrangement in a $p\times(p-1)$ Fermat quotient matrix $\mathtt{FQM}(p)$ of integers from…

Let $A$ and $B$ be complex numbers, and let $(w_n)_{n\ge0}$ be a sequence of complex numbers with $w_{n+1}=Aw_n-Bw_{n-1}$ for all $n=1,2,3,\ldots$. When $w_0=0$ and $w_1=1$, the sequence $(w_n)_{n\ge0}$ is just the Lucas sequence…

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

Linear predictors form a rich class of hypotheses used in a variety of learning algorithms. We present a tight analysis of the empirical Rademacher complexity of the family of linear hypothesis classes with weight vectors bounded in…

Neural networks with ReLU activations are a widely used model in machine learning. It is thus important to have a profound understanding of the properties of the functions computed by such networks. Recently, there has been increasing…

The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a…

Let $p$ be a prime. We study the structure of and the inclusion relations among the terms in the monomial lattice in the modular symmetric power representations of $\mathrm{GL}_2(\mathbb{F}_p)$. We also determine the structure of certain…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…

We prove that the equation \begin{eqnarray*} -\Delta_p u =\lambda\Big( \frac{1} {u^\delta} + u^q + f(u)\Big)\;\text{ in } \, B_R(0) u =0 \,\text{ on} \; \partial B_R(0), \quad u>0 \text{ in } \, B_R(0) \end{eqnarray*} admits a weak radially…

The main purpose of this paper is using a very simple constructive method to study an old number theory problem related to the Legendre symbol modulo p, and completely solved it. The proving method of the result is purely elementary and has…

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…