English
Related papers

Related papers: Linear complexity of Legendre-polynomial quotients

200 papers

We study higher regularity for weak solutions of the $p$-Laplace equation $-\Delta_p u = f$ in a domain $\Omega \subset \mathbb{R}^n$ for $p$ sufficiently close to 2. For $m \ge 3$, assuming that $f$ satisfies suitable Sobolev and H\"older…

Analysis of PDEs · Mathematics 2026-02-04 Felice Iandoli , Giuseppe Spadaro , Domenico Vuono

Using a variational technique we guarantee the existence of a solution to the \emph{resonant Lane-Emden} problem $-\Delta_p u=\lambda |u|^{q-2}u$, $u|_{\partial\Omega}=0$ if and only if a solution to $-\Delta_p u=\lambda |u|^{q-2}u+f$,…

Analysis of PDEs · Mathematics 2016-02-01 Ratan K. Giri , D. Choudhuri

Supplying the missing necessary conditions, we complete the characterisation of the $L^p\to L^q$ boundedness of commutators $[b,T]$ of pointwise multiplication and Calder\'on-Zygmund operators, for arbitrary pairs of $1<p,q<\infty$ and…

Classical Analysis and ODEs · Mathematics 2021-10-11 Tuomas P. Hytönen

We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the…

Information Theory · Computer Science 2019-05-07 Mihai Caragiu , Shannon Tefft , Aaron Kemats , Travis Maenle

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is $\log$-complete in $\Pi_2^p$. It had been shown quite recently that already the containment problem for multi-dimensional linear sets…

Computational Complexity · Computer Science 2018-02-21 Hans U. Simon

In this paper we compute the leading coefficients $\mu (u,w)$ of the Kazhdan--Lusztig polynomials $P_{u,w}$ for an affine Weyl group of type $\tilde{B}_2$. By using the \textbf{a}-function of a Coxeter group defined by Lusztig (see [L1,…

Combinatorics · Mathematics 2010-03-26 Liping Wang

This paper investigates the multiplicity of singular solutions for the nonlinear elliptic equation $-\Delta u =f(u)$ near the origin. Applying the classification of nonlinear functions and the transformation, which were developed by the…

Analysis of PDEs · Mathematics 2025-07-29 Yohei Fujishima , Norisuke Ioku

In this paper we establish the following estimate \[ w\left(\left\{ x\in\mathbb{R}^{n}\,:\,\left|[b,T]f(x)\right| > \lambda\right\} \right)\leq…

Classical Analysis and ODEs · Mathematics 2017-11-13 Carlos Pérez , Israel P. Rivera-Ríos

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

Number Theory · Mathematics 2017-07-06 Hajime Kaneko , Thomas Stoll

If $f\!:\![a,b]\to\R$ such that $f^{(n)}$ is integrable then integration by parts gives the formula \begin{align*} &\intab f(x)\,dx = &\frac{(-1)^n}{n!}\sum_{k=0}^{n-1}(-1)^{n-k-1}\left[ \phi_n^{(n-k-1)}(a)f^{(k)}(a)-…

Classical Analysis and ODEs · Mathematics 2016-05-02 Erik Talvila

In this paper, we study non-linear differential equations associated with Legendre polynomials and their applications. From our study of non- linear differential equations, we derive some new and explicit identities for Legendre…

Number Theory · Mathematics 2016-03-15 Taekyun Kim , Dae san Kim

This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…

Combinatorics · Mathematics 2010-09-01 Velleda Baldoni , Michele Vergne

This paper studies the integration problem in differential fields that may involve quantities reminiscent of the Weierstrass $\wp$ function, which are defined by a first-order nonlinear differential equation. We extend the classical notion…

Symbolic Computation · Computer Science 2026-02-09 Shaoshi Chen , Manuel Kauers , Wenqiao Li , Xiuyun Li , David Masser

For a fixed prime $p$, let $\mathbb C_p$ denote the complex $p$-adic numbers. For polynomials $A,B\in \mathbb C_p[x]$ we consider decompositions $A(x)f^2(x)+B(x)g^2(x)=1$ of entire functions $f,\,g$ on $\mathbb C_p$ and try to improve an…

Number Theory · Mathematics 2010-07-30 Eberhard Mayerhofer

In this paper, we study the complexity of p-adic continued fractions of a rational number, which is the p-adic analogue of the theorem of Lame. We calculate the length of Browkin expansion, and the length of Schneider expansion. Also, some…

Number Theory · Mathematics 2024-06-04 Rafik Belhadef , Henri-Alex Esbelin

We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…

Computational Complexity · Computer Science 2025-09-11 Somnath Chakraborty

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

Number Theory · Mathematics 2014-08-08 Hao Pan , Zhi-Wei Sun

As a natural generalization of the Legendre symbol, the $q$-th power residue symbol $(a/p)_q$ is defined for primes $p$ and $q$ with $p\equiv 1 \bmod q$. In this paper, we generalize the second supplementary law by providing an explicit…

Number Theory · Mathematics 2025-06-10 Yoshinosuke Hirakawa , Tomokazu Kashio , Ryutaro Sekigawa , Naoaki Takada , Shuji Yamamoto

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

Information Theory · Computer Science 2015-07-21 Shudi Yang , Zheng-An Yao
‹ Prev 1 8 9 10 Next ›