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]$.     

On an open problem concerning total domination critical graphs

A graph G   with no isolated vertex is total domination vertex critical if for any vertex v$v$ of G   that is not adjacent to a vertex of degree one, the total domination number of G-v$G-v$ is less than the total domination number of G  . We call these graphs _γt${\gamma }_t$-critical. If such a graph G has total domination number k, we call it k  -_γt${\gamma }_t$-critical. We verify an open problem of k  -_γt${\gamma }_t$-critical graphs and obtain some results on the characterization of total domination critical graphs of order n=Δ(G)(_γt(G)-1)+1$n=\Delta (G)({\gamma }_t(G)-1)+1$.     

On rigidity of Roe algebras

Roe algebras are C^?$C^{?}$-algebras built using large scale (or ‘coarse’) aspects of a metric space (X,d)$(X,d)$. In the special case that X=Γ$X=\Gamma$ is a finitely generated group and d   is a word metric, the simplest Roe algebra associated to (Γ,d)$(\Gamma ,d)$ is isomorphic to the crossed product C^?$C^{?}$-algebra l^∞(Γ)_?rΓ$l^{\infty }(\Gamma ){?}_r\Gamma$.     

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.     

Sharp upper bounds on the distance spectral radius of a graph

Let M=(_mij)$M=(m_{ij})$ be a nonnegative irreducible n×n$n\times n$ matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M  , denoted by ρ(M)$\rho (M)$. In this paper, we give two sharp upper bounds of the spectral radius of matrix M. As corollaries, we give two sharp upper bounds of the distance matrix of a graph.     

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 oriented graphs whose skew spectral radii do not exceed 2

Let S(G^σ)$S(G^{\sigma })$ be the skew adjacency matrix of the oriented graph G^σ$G^{\sigma }$ of order n   and _λ1,_λ2,…,_λn${\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n$ be all eigenvalues of S(G^σ)$S(G^{\sigma })$. The skew spectral radius _ρs(G^σ)${\rho }_s(G^{\sigma })$ of G^σ$G^{\sigma }$ is defined as max{|_λ1|,|_λ2|,…,|_λn|}$\max \{|{\lambda }_1|,|{\lambda }_2|,\dots ,|{\lambda }_n|\}$. In this paper, we investigate oriented graphs whose skew spectral radii do not exceed 2.     

Inequivalent representations of matroids over prime fields

It is proved that for each prime field GF(p)$\mathit{GF}(p)$, there is an integer _np$n_p$ such that a 4-connected matroid has at most _np$n_p$ inequivalent representations over GF(p)$\mathit{GF}(p)$. We also prove a stronger theorem that obtains the same conclusion for matroids satisfying a connectivity condition, intermediate between 3-connectivity and 4-connectivity that we term “k-coherence”.     

Numerical experiments on the accuracy of the Chebyshev–Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

For a function f(x)$f(x)$ that is smooth on the interval x∈[a,b]$x\in [a,b]$ but otherwise arbitrary, the real-valued roots on the interval can always be found by the following two-part procedure. First, expand f(x)$f(x)$ as a Chebyshev polynomial series on the interval and truncate for sufficiently large N. Second, find the zeros of the truncated Chebyshev series. The roots of an arbitrary polynomial of degree N  , when written in the form of a truncated Chebyshev series, are the eigenvalues of an N×N$N\times N$ matrix whose elements are simple, explicit functions of the coefficients of the Chebyshev series. This matrix is a generalization of the Frobenius companion matrix. We show by experimenting with random polynomials, Wilkinson's notoriously ill-conditioned polynomial, and polynomials with high-order roots that the Chebyshev companion matrix method is remarkably accurate for finding zeros on the target interval, yielding roots close to full machine precision. We also show that it is easy and cheap to apply Newton's iteration directly to the Chebyshev series so as to refine the roots to full machine precision, using the companion matrix eigenvalues as the starting point. Lastly, we derive a couple of theorems. The first shows that simple roots are stable under small perturbations of magnitude ε$\epsilon$ to a Chebyshev coefficient: the shift in the root _x*$x_{*}$ is bounded by ε/df/dx(_x*)+O(ε²)$\epsilon /\mathrm{d}f/\mathrm{d}x(x_{*})+\mathrm{O}({\epsilon }^2)$ for sufficiently small ε$\epsilon$. Second, we show that polynomials with definite parity (only even or only odd powers of x) can be solved by a companion matrix whose size is one less than the number of nonzero coefficients, a vast cost-saving.     

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.