English
Related papers

Related papers: Linear complexity of Legendre-polynomial quotients

200 papers

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed…

Information Theory · Computer Science 2018-01-03 Cuiling Fan

We prove a weak comparison principle in narrow unbounded domains for solutions to $-\Delta_p u=f(u)$ in the case $2<p< 3$ and $f(\cdot)$ is a power-type nonlinearity, or in the case $p>2$ and $f(\cdot)$ is super-linear. We exploit it to…

Analysis of PDEs · Mathematics 2012-10-08 Alberto Farina , Luigi Montoro , Berardino Sciunzi

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…

Number Theory · Mathematics 2011-11-07 Qi Cheng , Joshua E. Hill , Daqing Wan

Let $p>3$ be a prime and $(\frac{.}{p})$ be the Legendre symbol. For any integer $d$ with $p\nmid d$ and any positive integer $m$, Sun introduced the determinants…

Number Theory · Mathematics 2024-07-15 Chen-kai Ren , Xin-qi Luo

We consider local weak solutions to the fractional $p$-Poisson equation of order $s$, i.e. $\left( - \Delta_p\right)^s u = f$. In the range $p>1$ and $s\in \big(\frac{p-1}{p},1\big)$ we prove Calder\'on & Zygmund type estimates at the…

Analysis of PDEs · Mathematics 2025-03-11 Verena Bögelein , Frank Duzaar , Naian Liao , Kristian Moring

Given the Fourier-Legendre expansions of $f$ and $g$, and mild conditions on $f$ and $g$, we derive the Fourier-Legendre expansion of their product in terms of their corresponding Fourier-Legendre coefficients. In this way, expansions of…

Numerical Analysis · Mathematics 2024-03-26 Rabia Djellouli , David Klein , Matthew Levy

Global weighted $L^{p}$-estimates are obtained for the gradient of solutions to a class of linear singular, degenerate elliptic Dirichlet boundary value problems over a bounded non-smooth domain. The coefficient matrix is symmetric,…

Analysis of PDEs · Mathematics 2016-12-19 Dat Cao , Tadele Mengesha , Tuoc Phan

Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with…

Number Theory · Mathematics 2023-06-22 Xinwei He , A. J. Hildebrand , Yuchen Li , Yunyi Zhang

The $p$-adic Littlewood conjecture (PLC) states that $\liminf_{q\to\infty} q\cdot |q|_p \cdot ||qx|| = 0$ for every prime $p$ and every real $x$. Let $w_{CF}(x)$ be an infinite word composed of the continued fraction expansion of $x$ and…

Number Theory · Mathematics 2015-02-24 Dzmitry Badziahin

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou , Arnaud Jehanne

We solve the Neumann problem in the half space $\mathbb{R}^{n+1}_+$, for higher order elliptic differential equations with variable self-adjoint $t$-independent coefficients, and with boundary data in the negative smoothness space $\dot…

Analysis of PDEs · Mathematics 2019-07-01 Ariel Barton

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity.…

Computer Vision and Pattern Recognition · Computer Science 2014-03-14 Guanyu Yang , Huazhong Shu , Christine Toumoulin , Guo-Niu Han , Limin M. Luo

We prove an explicit formula for the $p$-adic valuation of the Legendre polynomials $P_n(x)$ evaluated at a prime $p$, and generalize an old conjecture of the third author. We also solve a problem proposed by Cigler in 2017.

Number Theory · Mathematics 2025-05-15 Max A. Alekseyev , Tewodros Amdeberhan , Jeffrey Shallit , Ingrid Vukusic

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Symbolic Computation · Computer Science 2015-12-22 Jean-Charles Faugère , Mohab Safey El Din , Thibaut Verron

The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…

Symbolic Computation · Computer Science 2026-04-30 Raphaël Pagès

We introduce a new method with spectral accuracy to solve linear non-autonomous ordinary differential equations (ODEs) of the kind $ \frac{d}{dt}\tilde{u}(t) = \tilde{f}(t) \tilde{u}(t)$, $\tilde{u}(-1)=1$, with $\tilde{f}(t)$ an analytic…

Numerical Analysis · Mathematics 2023-03-21 Stefano Pozza , Niel Van Buggenhout

We derive some identities and relations and extremal problems and minimization and Fourier development involving of integral Legendre polynomials.

Numerical Analysis · Mathematics 2025-01-14 Abdelhamid Rehouma

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

Number Theory · Mathematics 2015-03-12 Neranga Fernando , Xiang-dong Hou

In this paper we study the boundedness on $L^p(w)$ of the maximal operator $M_{A^{-1}}$, defined by $M_{A^{-1}}f(x)=Mf(A^{-1}x)$, that is, the maximal of Hardy-Littlewood composed with a invertible matrix $A$. We present two different…

Classical Analysis and ODEs · Mathematics 2026-03-03 Gonzalo Ibañez-Firnkorn

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

Logic · Mathematics 2018-10-18 Laurent Bienvenu , Santiago Figueira , Benoit Monin , Alexander Shen