Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0510219

On a new asymptotic problem in the scattering setting

F. Peherstorfer·A. Volberg·P. Yuditskii
View original source ↗Read source document ↗Export metadata ↓

Abstract

In recent works we considered an asymptotic problem for orthogonal polynomials when a Szegö measure on the unit circumference is perturbed by an arbitrary Blaschke sequence of point masses outside the unit disk. In the current work we consider a similar problem in the scattering setting.

Explore related subjects

math.SPmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. Peherstorfer, A. Volberg, P. Yuditskii. 2005-10-11. On a new asymptotic problem in the scattering setting. https://arxiv.org/abs/math/0510219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Weighted eigenvalues of Dirac operators: complete continuity and comparison

We give a min-max characterization of all of the weighted Dirac eigenvalues, and show that the weighted eigenvalues and eigenspaces of Dirac operators are continuous with respect to weak $L^p$ convergence of the weight, for any $p>n$. Moreover, we establish a comparison result for such weighted eigenvalue problems including the case of nontrivial harmonic spinors.

math.SP↗
arXiv2026

Neighbourhood second Zagreb matrix of graphs: spectral radius bounds and extremal graphs

Let $G$ be a connected graph on at least two vertices, and let $δ(i)$ be the sum of the degrees of the neighbours of a vertex $i$. The \emph{neighbourhood second Zagreb matrix} $\NF(G)$ has $(i,j)$-entry $δ(i)δ(j)$ if $i\sim j$ and $0$ otherwise; its spectral radius is denoted by $\rNF(G)$. We prove that $\rNF(G)\geρ(G)^{5}$, where $ρ(G)$ is the adjacency spectral radius, with equality if and only if $G$ is regular or bipartite semiregular, and we use this to show that the same graphs are exactly the extremal graphs of a Berman--Zhang--type upper bound. We sharpen the estimates $\demin^{2}ρ(G)\le\rNF(G)\le\demax^{2}ρ(G)$ by means of the extreme edge weights of $\NF(G)$, give sharp upper bounds in terms of the maximum degree $\dmax$, the maximum neighbourhood degree sum $\demax$, the size $m$ and the clique number $ω(G)$, and determine the extremal graphs for bipartite graphs and trees. For every connected unicyclic graph $G$ of order $n\ge3$ we prove $32=\rNF(C_n)\le\rNF(G)\le\rNF(\Sp n)$, where $\Sp n$ is the triangle with $n-3$ pendant edges at one vertex, with equality only for $C_n$ and only for $\Sp n$, respectively. Finally, we give bounds in terms of the first Zagreb index and for the neighbourhood second Zagreb energy; for lower energy bounds, the extremal graphs are described completely.

math.SP↗
arXiv2026

On isospectral potentials on periodic discrete graphs

We consider discrete Schrödinger operators with periodic (possibly complex valued) potentials $Q$ on periodic graphs. Using a system of spectral invariants obtained in \cite{S26}, we investigate the sets of isospectral potentials on periodic graphs. In particular, we show that the Floquet spectrum of the Schrödinger operators on the hexagonal lattice and on the Kagome lattice generically (with respect to perturbations of $Q$) determines the potential $Q$ uniquely up to the obvious symmetries (translations and rotations) in the periodic graph.

math.SP↗