English
Related papers

Related papers: Observable sets for Schr\"odinger equations on com…

200 papers

We give sufficient conditions for essential self-adjointness of magnetic Schr\"odinger operators on locally finite graphs. Two of the main theorems of the present paper generalize recent results of Torki-Hamza.

Spectral Theory · Mathematics 2011-08-23 Ognjen Milatovic

The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…

Data Analysis, Statistics and Probability · Physics 2017-09-13 Lucas Lacasa , Jacopo Iacovacci

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…

Optimization and Control · Mathematics 2015-03-19 Gianfranco Parlangeli , Giuseppe Notarstefano

We treat the stationary (cubic) nonlinear Schr\"odinger equation (NSLE) on simplest graphs. Formulation of the problem and exact analytical solutions of NLSE are presented for star graphs consisting of three bonds. It is shown that the…

Exactly Solvable and Integrable Systems · Physics 2018-10-03 Z. A. Sobirov , K. K. Sabirov , D. U. Matrasulov

The one-dimensional Schr\"{o}dinger equation with the singular harmonic oscillator is investigated. The Hermiticity of the operators related to observable physical quantities is used as a criterion to show that the attractive or repulsive…

Quantum Physics · Physics 2013-04-03 Douglas R. M. Pimentel , Antonio S. de Castro

The spectral determinant of the Schr\"odinger operator ($ - \Delta + V(x) $) on a graph is computed for general boundary conditions. ($\Delta$ is the Laplacian and $V(x)$ is some potential defined on the graph). Applications to restricted…

Mesoscale and Nanoscale Physics · Physics 2009-11-07 Jean Desbois

We construct rich families of Schr\"odinger operators on symmetric graphs, both quantum and combinatorial, whose spectral degeneracies are persistently larger than the maximal dimension of an irreducible representations of the symmetry…

Spectral Theory · Mathematics 2018-02-14 Gregory Berkolaiko , Wen Liu

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

Combinatorics · Mathematics 2020-05-05 Sherry Sarkar , Alexander Xue , Pablo Soberón

We investigate the observability properties of the Baouendi-Grushin equation on a tensorized domain $\Omega := \mathcal{B}_R \times \tilde \Omega$, where $\mathcal{B}_R$ is the open ball of radius $R$ in dimension $d \ge 2$, and $\tilde…

Optimization and Control · Mathematics 2026-04-03 Jérémi Dardé , Mathilda Trabut

We investigate observability and Lipschitz stability for the Heisenberg heat equation on the rectangular domain $$\Omega = (-1,1)\times\mathbb{T}\times\mathbb{T}$$ taking as observation regions slices of the form $\omega=(a,b) \times…

Analysis of PDEs · Mathematics 2021-04-07 Karine Beauchard , Piermarco Cannarsa

Let $G=(V,E)$ be a simple graph without isolated vertices. A set $S\subseteq V$ is a paired-dominating set if every vertex in $V-S$ has at least one neighbor in $S$ and the subgraph induced by $S$ contains a perfect matching. In this paper,…

Combinatorics · Mathematics 2009-08-21 Lei Chen , Changhong Lu , Zhenbing Zeng

We prove Strichartz estimates for the absolutely continuous evolution of a Schr\"odinger operator $H = (i\nabla + A)^2 + V$ in $\R^n$, $n > 2$. Both the magnetic and electric potentials are time-independent and satisfy pointwise polynomial…

Analysis of PDEs · Mathematics 2008-04-02 Michael Goldberg

In this paper, we investigate Strichartz estimates for discrete linear Schr\"odinger and discrete linear Klein-Gordon equations on a lattice $h\mathbb{Z}^d$ with $h>0$, where $h$ is the distance between two adjacent lattice points. As for…

Analysis of PDEs · Mathematics 2018-06-20 Younghun Hong , Changhun Yang

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…

Metric Geometry · Mathematics 2017-06-08 Josef Cibulka , Miroslav Korbelář , Jan Kynčl , Viola Mészáros , Rudolf Stolař , Pavel Valtr

In this article we prove a reducibility result for the linear Schr\"odinger equation on the sphere $\mathbb{S}^{n}$ with quasi-periodic in time perturbation. Our result includes the case of unbounded perturbation that we assume to be of…

Analysis of PDEs · Mathematics 2019-05-29 Roberto Feola , Benoît Grébert

We consider discrete Schr\"odinger operators with periodic potentials on periodic graphs. Their spectra consist of a finite number of bands. We perturb a periodic graph by adding edges in a periodic way (without changing the vertex set) and…

Spectral Theory · Mathematics 2024-07-02 Natalia Saburova

We consider the spin-$J$ XXZ-Hamiltonian on general graphs $\mathcal{G}$ and show its equivalence to a direct sum of discrete many-particle Schr\"odinger type operators on what we call "$N$-particle graphs with maximal local occupation…

Mathematical Physics · Physics 2019-02-12 Christoph Fischbacher

Consider the one-dimensional discrete Schr\"odinger operator $H_{\theta}$: $$(H_{\theta} q)_n=-(q_{n+1}+q_{n-1})+ V(\theta+n\omega) q_n \ , \quad n\in Z \ ,$$ with $\omega\in R^d$ Diophantine, and $V$ a real-analytic function on $ T^d=(…

Mathematical Physics · Physics 2019-12-04 Dario Bambusi , Zhiyan Zhao

A resolving set in a graph $G$ is a vertex subset $W= \{\omega^1, \dots, \omega^n\} \subseteq V(G)$ such that each $u \in V(G)$ can be uniquely identified by the vector $r(u \vert W) = (d(u,\omega^1), \dots, d(u,\omega^n))$ of metric…

Combinatorics · Mathematics 2026-02-06 Víctor Franco-Sánchez , Mercè Mora , María Luz Puertas