Related papers: The Spectral Problem and Algebras Associated with …

In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For $n>k$, let $S_{n,k}$ be the join of a clique on $k$ vertices with an independent set of $n-k$…

We study the spectral gap behavior of an operator obtained by summing a random permutation $M$ and a deterministic bistochastic matrix $Q$. We are interested in the asymptotic in terms of dimension. In the case where $(M,Q)$ are…

We study the scattering problem, the Sturm-Liouville problem and the spectral problem with periodic or skew-periodic boundary conditions for the one-dimensional Schr\"odinger equation with an $n$-cell (finite periodic) potential. We give…

Let $\Omega$ be an open, simply connected, and bounded region in $\mathbb{R}^{d}$, $d\geq2$, and assume its boundary $\partial\Omega$ is smooth. Consider solving an elliptic partial differential equation $-\Delta u+\gamma u=f$ over $\Omega$…

The spectral propinquity is a distance, up to unitary equivalence, on the class of metric spectral triples. We prove in this paper that if a sequence of metric spectral triples converges for the propinquity, then the spectra of the Dirac…

Given integers $n\ge \Delta\ge 2$, let $\mathcal{T}(n, \Delta)$ be the collection of all $n$-vertex trees with maximum degree at most $\Delta$. A question of Alon, Krivelevich and Sudakov in 2007 asks for determining the best possible…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

The spectral analogue of the Tur\'{a}n type problem for hypergraphs is to determine the maximum spectral radius for the hypergraphs of order $n$ that do not contain a given hypergraph. For the hypergraphs among the set of the connected…

The asymptotic restriction problem for tensors is to decide, given tensors $s$ and $t$, whether the nth tensor power of $s$ can be obtained from the $(n+o(n))$th tensor power of t by applying linear maps to the tensor legs (this we call…

We analyse an operator arising in the description of singular solutions to the two-dimensional Keller-Segel problem. It corresponds to the linearised operator in parabolic self-similar variables, close to a concentrated stationary state.…

Necessary and sufficient conditions are presented for a measure to be the spectral measure of a finite range or exponentially decaying perturbation of a periodic Jacobi operator. As a corollary we can fully solve the inverse resonance…

The main objective of this paper is to develop a notion of joint spectrum for complex solvable Lie algebras of operators acting on a Banach space, which generalizes the Taylor joint spectrum (T.J.S.) for several commuting operators.

The spectral properties of a class of non-selfadjoint second order elliptic operators with indefinite weight functions on unbounded domains $\Omega$ are investigated. It is shown that under an abstract regularity assumption the nonreal…

The spectral properties of two-dimensional Schr\"odinger operators with $\delta'$-potentials supported on star graphs are discussed. We describe the essential spectrum and give a complete description of situations in which the discrete…

This paper is concerned with the reduction of the spectral problem for symmetric linear operator pencils to a spectral problem for the single operator. Also, a Rayleigh-Ritz-like bounds on eigenvalues of linear operator pencils are…

This work is a continuation and extension of the note published in the Russian Math Surveys 1997 n 6. For any pair of solutions of the spectral problem for the second order selfadjoint real Schrodinger Operator on the graph their Symplectic…

For a set of graphs $\mathcal{F}$, let $\ex(n,\mathcal{F})$ and $\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximum spectral radius of an $n$-vertex $\mathcal{F}$-free graph, respectively. Nikiforov ({\em LAA}, 2007)…

We formulate the problem of numerical analytic continuation in a way that lets us draw meaningful conclusions about properties of the spectral function based solely on the input data. Apart from ensuring consistency with the input data…

The subject of the paper are Schr\"odinger operators on tree graphs which are radial having the branching number $b_n$ at all the vertices at the distance $t_n$ from the root. We consider a family of coupling conditions at the vertices…

We describe a new method to remove short cycles on regular graphs while maintaining spectral bounds (the nontrivial eigenvalues of the adjacency matrix), as long as the graphs have certain combinatorial properties. These combinatorial…