Related papers: The Spectral Problem and Algebras Associated with …
Consider the Jacobi operators $\cJ$ given by $(\cJ y)_n=a_ny_{n+1}+b_ny_n+a_{n-1}^*y_{n-1}$, $y_n\in \C^m$ (here $y_0=y_{p+1}=0$), where $b_n=b_n^*$ and $a_n:\det a_n\ne 0$ are the sequences of $m\ts m$ matrices, $n=1,..,p$. We study two…
In this paper, we briefly explain the spectral expansion problem for differential operators defined on the entire real line, generated by a differential expression with periodic, complex-valued coefficients.
For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide…
The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…
We discuss the problems arising when computing eigenvalues of self-adjoint operators which lie in a gap between two parts of the essential spectrum. Spectral pollution, i.e. the apparent existence of eigenvalues in numerical computations,…
Given a connected graph $G$ and a terminal set $R \subseteq V(G)$, the minimum Steiner tree problem (ST) asks for a tree that spans all of $R$ with at most $r$ vertices from $V(G)\backslash R$, for some integer $r\geq 0$. A \emph{split…
On the half line $[0,\infty)$ we study first order differential operators of the form $B 1/i d/(dx) + Q(x)$, where $B:=\mat{B_1}{0}{0}{-B_2}$, $B_1,B_2\in M(n,\C)$ are self--adjoint positive definite matrices and $Q:\R_+\to M(2n,\C)$,…
Let $R$ and $B$ be two disjoint sets of points in the plane where the points of $R$ are colored red and the points of $B$ are colored blue, and let $n=|R\cup B|$. A bichromatic spanning tree is a spanning tree in the complete bipartite…
Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…
We consider the problem of variation of spectral subspaces for linear self-adjoint operators under off-diagonal perturbations. We prove a number of new optimal results on the shift of the spectrum and obtain (sharp) estimates on the norm of…
Given a LHS (Lattice of Hilbert spaces) $V_J$ and a symmetric operator $A$ in $V_J$, in the sense of partial inner product spaces, we define a generalized resolvent for $A$ and study the corresponding spectral properties. In particular, we…
The variation of spectral subspaces for linear self-adjoint operators under an additive bounded semidefinite perturbation is considered. A variant of the Davis-Kahan $ \sin2\Theta $ theorem from [SIAM J. Numer. Anal. 7 (1970), 1--46]…
Boundary value problems on hedgehog-type graphs for Sturm-Liouville differential operators with general matching conditions are studied. We investigate inverse spectral problems of recovering the coefficients of the differential equation…
The degree-diameter problem consists of finding the maximum number of vertices $n$ of a graph with diameter $d$ and maximum degree $\Delta$. This problem is well studied, and has been solved for plane graphs of low diameter in which every…
We extend naturally the spectral triple which define noncommutative geometry (NCG) in order to incorporate supersymmetry and obtain supersymmetric Dirac operator D_M which acts on Minkowskian manifold. Inversely, we can consider the…
We prove that given a symmetric completely non-selfadjoint operator $B$ with finite deficiency indices $(n,n)$ on a Hilbert space and a boundary triplet $\left(\mathbb{C}^{n},\Gamma_{1},\Gamma_{2}\right)$ for $B^{*}$, the set of points in…
In the 1960s, Erd\H{o}s and his cooperators initiated the research of the maximum numbers of edges in a graph or a planar graph on $n$ vertices without $k$ edge-disjoint cycles. This problem had been solved for $k\leq4$. As pointed out by…
The spectral and scattering properties of non-selfadjoint problems pose a mathematical challenge. Apart from exceptional cases, the well-developed methods used to examine the spectrum of selfadjoint problems are not applicable. One of the…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…