Related papers: Linear complexity of Legendre-polynomial quotients

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

We compute the operator $p$-norm of some $n\times n$ complex matrices, which can be seen as bounded linear operators on the $n$ dimensional Banach space $\ell^p(n)$. The notion of logarithmic affine matrices is defined, and for such a…

In this paper, we provide a new and sharper bound for the Legendre coefficients of differentiable functions and then derive a new error bound of the truncated Legendre series in the uniform norm. The key idea of proof relies on integration…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

We present a new fractional Taylor formula for singular functions whose Caputo fractional derivatives are of bounded variation. It bridges and ``interpolates" the usual Taylor formulas with two consecutive integer orders. This enables us to…

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

We classify unitary highest weight modules with a given integral infinitesimal character for the real Lie algebras $\mathfrak{su}(p,q)$ and $\mathfrak{so}^*(2n)$. We treat both regular and singular cases. For $\mathfrak{su}(p,q)$ we…

In this paper, we reduce the logarithmic Sarnak conjecture to the $\{0,1\}$-symbolic systems with polynomial mean complexity. By showing that the logarithmic Sarnak conjecture holds for any topologically dynamical system with sublinear…

We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…

In this paper, we prove some qualitative properties for the positive solutions to some degenerate elliptic equation given by \[-\operatorname{div}(w|\nabla u|^{p-2}\nabla u)=f(x,u);\;\;w\in \mathcal{A}_p\] on smooth domain and for varying…

A binary code Enc$:\{0,1\}^k \to \{0,1\}^n$ is $(0.5-\epsilon,L)$-list decodable if for all $w \in \{0,1\}^n$, the set List$(w)$ of all messages $m \in \{0,1\}^k$ such that the relative Hamming distance between Enc$(m)$ and $w$ is at most…

We establish the $L_p$-regularity theory for a semilinear stochastic partial differential equation with multiplicative white noise: $$ du = (a^{ij}u_{x^ix^j} + b^{i}u_{x^i} + cu + \bar b^{i}|u|^\lambda u_{x^i})dt + \sigma^k(u)dw_t^k,\quad…

The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is…

For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…

For every $p \geq 2$, we obtained an explicit construction of a family of $\mathcal{W}(2,2p-1)$-modules, which decompose as direct sum of simple Virasoro algebra modules. Furthermore, we classified all irreducible self-dual…

Let $p$ be an odd prime. It is well known that $F_{p-(\frac p5)}\equiv 0\pmod{p}$, where $\{F_n\}_{n\ge0}$ is the Fibonacci sequence and $(-)$ is the Jacobi symbol. In this paper we show that if $p\not=5$ then we may determine $F_{p-(\frac…

Let $p>3$ be a prime. In this paper, we obtain the congruences for $$\sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^3}{(-8)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{3k}k}{(-192)^k},\…

We show that the complexity of the Lie module $\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $p^m$ is the largest $p$-power dividing $n$ and, if $n$ is not a $p$-power, is equal to the maximum of the complexities of…

In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in parameterized complexity, the notion of weighted…

For permutations x and w, let mu(x,w) be the coefficient of highest possible degree in the Kazhdan-Lusztig polynomial P_{x,w}. It is well-known that the coefficients mu(x,w) arise as the edge labels of certain graphs encoding the…