An approximation method for strictly pseudocontractive mappings

Let K$K$ be a closed convex subset of a q$q$-uniformly smooth separable Banach space, T:K→K$T:K\to K$ a strictly pseudocontractive mapping, and f:K→K$f:K\to K$ an L$L$-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)$t\in (0,1)$, let _xt$x_t$ be the unique fixed point of tf+(1-t)T$\mathit{tf}+(1-t)T$. We prove that if T$T$ has a fixed point, then {_xt}$\{x_t\}$ converges to a fixed point of T$T$ as t$t$ approaches to 0.     

The inverse inertia problem for the complements of partial k-trees

Let F$\mathbb{F}$ be an infinite field with characteristic not equal to two. For a graph G=(V,E)$G=(V,E)$ with V={1,…,n}$V=\{1,\dots ,n\}$, let S(G;F)$S(G;\mathbb{F})$ be the set of all symmetric n×n$n\times n$ matrices A=[_ai,j]$A=[a_{i,j}]$ over F$\mathbb{F}$ with _ai,j≠0$a_{i,j}\ne 0$, i≠j$i\ne j$ if and only if ij∈E$ij\in E$. We show that if G is the complement of a partial k  -tree and m?k+2$m?k+2$, then for all nonsingular symmetric m×m$m\times m$ matrices K   over F$\mathbb{F}$, there exists an m×n$m\times n$ matrix U   such that U^TKU∈S(G;F)$U^{T}KU\in S(G;\mathbb{F})$. As a corollary we obtain that, if k+2?m?n$k+2?m?n$ and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=m$p+q=m$, there exists a matrix in S(G;R)$S(G;\mathbb{R})$ with p positive and q negative eigenvalues.     

On the norming constants for normal maxima

Given n   independent standard normal random variables, it is well known that their maxima _Mn$M_n$ can be normalized such that their distribution converges to the Gumbel law. In a remarkable study, Hall proved that the Kolmogorov distance _dn$d_n$ between the normalized _Mn$M_n$ and its associated limit distribution is less than 3/log?n$3/\log ?n$. In the present study, we propose a different set of norming constants that allow this upper bound to be decreased with _dn≤C(m)/log?n$d_n\le C(m)/\log ?n$ for n≥m≥5$n\ge m\ge 5$. Furthermore, the function C(m)$C(m)$ is computed explicitly, which satisfies C(m)≤1$C(m)\le 1$ and _limm→∞?C(m)=1/3${\lim }_{m\to \infty }?C(m)=1/3$. As a consequence, some new and effective norming constants are provided using the asymptotic expansion of a Lambert W type function.     

Concentration and multiplicity of solutions for a fourth-order equation with critical nonlinearity

In this paper, we consider the problem (_Pε)$(P_{\epsilon })$ : Δ²u=u^n+4/n-4+εu,u>0${\mathrm{\Delta }}^{2}u=u^{n+4/n-4}+\epsilon u,u>0$ in Ω,u=Δu=0$\Omega ,u=\mathrm{\Delta }u=0$ on ∂Ω$\mathrm{\partial }\Omega$, where Ω$\Omega$ is a bounded and smooth domain in Rⁿ,n>8${\mathbb{R}}^n,n>8$ and ε>0$\epsilon >0$. We analyze the asymptotic behavior of solutions of (_Pε)$(P_{\epsilon })$ which are minimizing for the Sobolev inequality as ε→0$\epsilon \to 0$ and we prove existence of solutions to (_Pε)$(P_{\epsilon })$ which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for ε$\epsilon$ small, (_Pε)$(P_{\epsilon })$ has at least as many solutions as the Ljusternik–Schnirelman category of Ω$\Omega$.     

On the least distance eigenvalue of a graph

Denote by D(G)=_(di,j)n×n$D(G)={(d_{i,j})}_{n\times n}$ the distance matrix of a connected graph G with n   vertices, where _dij$d_{ij}$ is equal to the distance between vertices _vi$v_i$ and _vj$v_j$ in G  . The least eigenvalue of D(G)$D(G)$ is called the least distance eigenvalue of G  , denoted by _λn${\lambda }_n$. In this paper, we determine all the graphs with _λn∈[−2.383,0]${\lambda }_n\in [-2.383,0]$.