We perform a complete study of the truncation error of the Jacobi-Anger series. This series expands every plane wave ${\mathrm{e}}^{i\widehat{s}·\overrightarrow{v}}$ in terms of spherical harmonics ${\left\{Y_{\ell ,m}\left(\widehat{s}\right)\right\}}_{\left|m\right|\le \ell \le \infty }$. We consider the truncated series where the summation is performed over the $(\ell ,m)$'s satisfying $\left|m\right|\le \ell \le L$. We prove that if $v=|\overrightarrow{v}|$ is large enough, the truncated series gives rise to an error lower than as soon as satisfies $L+\frac{1}{2}\simeq v+C{W}^{\frac{2}{3}}\left(K{ϵ}^{-\delta }{v}^{\gamma }\right)v^{\frac{1}{3}}$ where is the Lambert function and $C,K,\delta ,\gamma$ are pure positive constants. Numerical experiments show that this asymptotic...

The complexity of computing, via threshold circuits, the and of fixed-dimension $k\times k$ matrices with integer or rational entries is studied. We call these two problems ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ and ${\mathrm{𝖬𝖯𝖮𝖶}}_{𝗄}$, respectively, for short. We prove that: (i) For $k\ge 2$, ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ does not belong to ${\mathrm{TC}}^0$, unless ${\mathrm{TC}}^0={\mathrm{NC}}^1$.newline (ii) For : ${\mathrm{𝖨𝖬𝖯}}_{\mathsf{2}}$ belongs to ${\mathrm{TC}}^0$ while, for $k\ge 3$, ${\mathrm{𝖨𝖬𝖯}}_{𝗄}$ does not belong to ${\mathrm{TC}}^0$, unless ${\mathrm{TC}}^0={\mathrm{NC}}^1$. (iii) For any , ${\mathrm{𝖬𝖯𝖮𝖶}}_{𝗄}$ belongs to ${\mathrm{TC}}^0$.

We consider a class of semilinear elliptic equations of the form 15.7cm -${\epsilon }^2\Delta u(x,y)+a\left(x\right)W^{\text{'}}\left(u(x,y)\right)=0,(x,y)\in {ℝ}^2$ where $\epsilon >0$, $a:ℝ\to ℝ$ is a periodic, positive function and $W:ℝ\to ℝ$ is modeled on the classical two well Ginzburg-Landau potential $W\left(s\right)={(s^2-1)}^2$. We look for solutions to ([see full textsee full text]) which verify the asymptotic conditions $u(x,y)\to \pm 1$ as $x\to \pm \infty$ uniformly with respect to $y\in ℝ$. We show variational methods that if is sufficiently small and is not constant, then ([see full textsee full text]) admits infinitely many of such solutions,...

Let be one solution to $${\partial }_{t}y(t,x)-\sum _{i,j=1}^n{\partial }_j\left(a_{ij}\left(x\right){\partial }_{i}y(t,x)\right)=h(t,x),0<t<T,x\in \Omega$$ with a non-homogeneous term , and ${y|}_{(0,T)\times \partial \Omega }=0$, where $\Omega \subset {ℝ}^n$ is a bounded domain. We discuss an inverse problem of determining unknown functions by $\{{\partial }_{\nu }y\left(h_{\ell }\right){|}_{(0,T)\times {\Gamma }_0}$, $y\left(h_{\ell }\right)(\theta ,·){\}}_{1\le \ell \le {\ell }_0}$ after selecting input sources $h_1,...,h_{{\ell }_0}$ suitably, where ${\Gamma }_0$ is an arbitrary subboundary, ${\partial }_{\nu }$ denotes the normal derivative, $0<\theta <T$ and ${\ell }_0\in \mathbb{N}$. In the case of ${\ell }_0={(n+1)}^{2}n/2$, we prove the Lipschitz stability in the inverse problem if we choose $(h_1,...,h_{{\ell }_0})$ from a set $\mathscr{H}\subset {\left\{C_0^{\infty }((0,T)\times \omega )\right\}}^{{\ell }_0}$ with an arbitrarily fixed subdomain $\omega \subset \Omega$. Moreover we can take ${\ell }_0=(n+3)n/2$ by making special choices...

This paper deals with lower bounds on the approximability of different subproblems of the Traveling Salesman Problem (TSP) which is known not to admit any polynomial time approximation algorithm in general (unless $𝒫=\mathrm{𝒩𝒫}$). First of all, we present an improved lower bound for the Traveling Salesman Problem with Triangle Inequality, -TSP for short. Moreover our technique, an extension of the method of Engebretsen [11], also applies to the case of relaxed and sharpened triangle inequality, respectively,...