相关论文: Spectral determinants and an Ambarzumian type theo…

We provide a very general result that identifies the essential spectrum of broad classes of operators as exactly equal to the closure of the union of the spectra of suitable limits at infinity. Included is a new result on the essential…

We obtain new partial results supporting the spectral set conjecture in dimension 1.

Eigenvalue spectrum of the Laplacian on a metric graph with arbitrary but fixed vertex conditions is investigated in the limit as the lengths of all edges decrease to zero at the same rate. It is proved that there are exactly four possible…

We present a conditionally exactly solvable singular potential for the one-dimensional Schr\"odinger equation which involves the exactly solvable inverse square root potential. Each of the two fundamental solutions that compose the general…

In this paper we show variant of the spectral theorem using an algebraic Jordan-Schwinger map. The advantage of this approach is that we don't have restriction of normality on the class of operators we consider. On the other side, we have…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

The purpose of this note is to study asymptotic zero distribution of multivariate random polynomials as their degrees grow. For a smooth weight function with super logarithmic growth at infinity, we consider random linear combinations of…

Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…

The spectrum of interior transmission problem is the zero set of certain entire functional determinant. It is classic that we deploy the series of exponential polynomials to approximate the distribution of the roots of the entire functions…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

We study a Schr\"odinger-like equation for the anharmonic potential $x^{2 \alpha}+\ell(\ell+1) x^{-2}-E$ when the anharmonicity $\alpha$ goes to $+\infty$. When $E$ and $\ell$ vary in bounded domains, we show that the spectral determinant…

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

We consider the Schr\"odinger operator on the zigzag and armchair nanotubes (tight-binding models) in a uniform magnetic field $\mB$ and in an external periodic electric potential. The magnetic and electric fields are parallel to the axis…

We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…

This is a complement to our paper arXiv:0802.1461. We study irreducibility of spectral determinants of some one-parametric eigenvalue problems in dimension one with polynomial potentials.

We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…

The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…

We consider discrete one-dimensional Schr\"odinger operators with strictly ergodic, aperiodic potentials taking finitely many values. The well-known tendency of these operators to have purely singular continuous spectrum of zero Lebesgue…

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…