Related papers: Optimizing the Fundamental Eigenvalue Gap of Quant…
This paper deals with eigenvalue optimization problems for a family of natural Schr\"odinger operators arising in some geometrical or physical contexts. These operators, whose potentials are quadratic in curvature, are considered on closed…
Spectral properties of Schr\"odinger operators on compact metric graphs are studied and special emphasis is put on differences in the spectral behavior between different classes of vertex conditions. We survey recent results especially for…
We give a survey of some results, mainly obtained by the authors and their collaborators, on spectral properties of the magnetic Schr\"odinger operators in the semiclassical limit. We focus our discussion on asymptotic behavior of the…
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked…
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…
We consider the Schr\"odinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite…
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…
Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…
We study the continuity of an abstract generalization of the maximum-entropy inference - a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a…
For relatively form-compact perturbations of non-negative selfadjoint operators, we obtain an upper bound on the number of discrete eigenvalues in half-planes separated from the positive real axis. The bound is given in terms of a partial…
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
The aim of this article is to analyze numerical schemes using two-layer neural networks withinfinite width for the resolution of high-dimensional Schr{\"o}dinger eigenvalue problems with smoothinteraction potentials and Neumann boundary…
The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erd\H{o}s and Moser from the 1960s. The minimum was always considered to be less…
We study discrete Schr\"odinger operators on the graphs corresponding to the triangular lattice, the hexagonal lattice, and the square lattice with next-nearest neighbor interactions. For each of these lattice geometries, we analyze the…
We investigate the uniqueness, in suitable weighted $\ell^p$ spaces, of solutions to the Schr\"odinger equation with a potential, posed on infinite graphs. The potential can tend to zero at infinite with a certain rate.
The fundamental gap is the difference between the first two Dirichlet eigenvalues of a Schr\"odinger operator (and the Laplacian, in particular). For horoconvex domains in hyperbolic space, Nguyen, Stancu and Wei conjectured that it is…
We study Schr\"odinger operators on an infinite quantum graph of a chain form which consists of identical rings connected at the touching points by $\delta$-couplings with a parameter $\alpha\in\R$. If the graph is "straight", i.e. periodic…
We study the approximability of the Maximum Independent Set (MIS) problem in $H$-free graphs (that is, graphs which do not admit $H$ as an induced subgraph). As one motivation we investigate the following conjecture: for every fixed graph…
We analyze properties of semigroups generated by Schr\"odinger operators $-\Delta+V$ or polyharmonic operators $-(-\Delta)^m$, on metric graphs both on $L^p$-spaces and spaces of continuous functions. In the case of spatially constant…
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…