English
Related papers

Related papers: Weyl Laws for Open Quantum Maps

200 papers

Let $\om $ be a bounded domain in an $n$-dimensional Euclidean space $\Bbb R^n$. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &\Delta {\mathbf u}+ \alpha{\rm grad}(\text{div}{\mathbf…

Differential Geometry · Mathematics 2010-09-09 Daguang Chen , Qing-Ming Cheng , Qiaoling Wang , Changyu Xia

Let $\Gamma_{w}$ be a non-cofinite Hecke triangle group with cusp width $w>2$ and let $\varrho\colon\Gamma_w\to U(V)$ be a finite-dimensional unitary representation of $\Gamma_w$. In this note we announce a new fractal upper bound for the…

Spectral Theory · Mathematics 2018-10-11 Frederic Naud , Anke Pohl , Louis Soares

We consider a quadratic matrix boundary value problem with equations and boundary conditions dependent on a spectral parameter. We study an inverse problem that consists in recovering the differential pencil by the so-called Weyl matrix. We…

Spectral Theory · Mathematics 2013-01-15 Natalia Bondarenko

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a…

Combinatorics · Mathematics 2024-05-24 Oliver Knill

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Combinatorics · Mathematics 2015-12-14 Eran Nevo , Guillermo Pineda-Villavicencio , David R. Wood

We prove a Weyl-exponent subconvex bound for any Dirichlet $L$-function of cube-free conductor. We also show a bound of the same strength for certain $L$-functions of self-dual $\mathrm{GL}_2$ automorphic forms that arise as twists of forms…

Number Theory · Mathematics 2022-05-17 Ian Petrow , Matthew P. Young

In this paper, we prove two new Weyl-type upper estimates for the eigenvalues of the Dirichlet Laplacian. As a consequence, we obtain the following {\em lower} bounds for its counting function. For $\la\ge \la_1$, one has N(\la) >…

Spectral Theory · Mathematics 2007-11-27 Lotfi Hermi

One can argue that on flat space $\mathbb{R}^d$ the Weyl quantization is the most natural choice and that it has the best properties (e.g. symplectic covariance, real symbols correspond to Hermitian operators). On a generic manifold, there…

Mathematical Physics · Physics 2020-05-07 Jan Dereziński , Adam Latosiński , Daniel Siemssen

Let $S$ be a spinor bundle of a pseudo-Euclidean vector bundle $(E,\mathrm{g})$ of even rank. We introduce a new filtration on the algebra $\mathcal{D}(M,S)$ of differential operators on $S$. As main property, the associated graded algebra…

Differential Geometry · Mathematics 2021-06-29 Melchior Grützmann , Jean-Philippe Michel , Ping Xu

We study the asymptotic behaviour of the eigenvalue counting function for self-adjoint elliptic linear operators defined through classical weighted symbols of order $(1,1)$, on an asymptotically Euclidean manifold. We first prove a two term…

Functional Analysis · Mathematics 2020-01-03 Sandro Coriasco , Moritz Doll

We consider the question of giving an upper bound for the first nontrivial eigenvalue of the Wentzell-Laplace operator of a domain $\Omega$, involving only geometrical informations. We provide such an upper bound, by generalizing Brock's…

Optimization and Control · Mathematics 2014-10-02 Marc Dambrine , Djalil Kateb , Jimmy Lamboley

Let $\Omega = \mathbb R^3 \setminus \bar{K}$, where $K$ is an open bounded domain with smooth boundary $\Gamma$. Let $V(t) = e^{tG_b},\: t \geq 0,$ be the semigroup related to Maxwell's equations in $\Omega$ with dissipative boundary…

Analysis of PDEs · Mathematics 2023-03-14 Vesselin Petkov

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv

We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…

Quantum Physics · Physics 2011-09-12 Andris Ambainis , Andrew M. Childs , Yi-Kai Liu

We obtain upper bounds for the eigenvalues of the Schr\"odinger operator $L=\Delta_g+q$ depending on integral quantities of the potential $q$ and a conformal invariant called the min-conformal volume. Moreover, when the Schr\"odinger…

Differential Geometry · Mathematics 2016-01-20 Asma Hassannezhad

This paper contains a lower bound of the Weyl type on the counting function of the positive eigenvalues of the interior transmission eigenvalue problem which justifies the existence of an infinite set of positive interior transmission…

Spectral Theory · Mathematics 2015-06-16 Evgeny Lakshtanov , Boris Vainberg

We determine the leading order fall-off behaviour of the Weyl tensor in higher dimensional Einstein spacetimes (with and without a cosmological constant) as one approaches infinity along a congruence of null geodesics. The null congruence…

General Relativity and Quantum Cosmology · Physics 2014-11-21 Marcello Ortaggio , Alena Pravdová

The idealized theory of quantum vacuum energy density is a beautiful application of the spectral theory of differential operators with boundary conditions, but its conclusions are physically unacceptable. A more plausible model of a…

Quantum Physics · Physics 2012-11-20 J. D. Bouas , S. A. Fulling , F. D. Mera , K. Thapa , C. S. Trendafilova , J. Wagner

We investigate two-dimensional canonical systems $y'=zJHy$ on an interval, with positive semi-definite Hamiltonian $H$, such that limit circle case prevails at the left endpoint and limit point case at the right . Let $q_H$ be the Weyl…

Spectral Theory · Mathematics 2023-05-31 Jakob Reiffenstein

We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.

Discrete Mathematics · Computer Science 2012-12-13 Shayan Oveis Gharan , Luca Trevisan