Related papers: Unique continuation on planar graphs

Every irreducible discrete-time linear switching system possesses an invariant convex Lyapunov function (Barabanov norm), which provides a very refined analysis of trajectories. Until recently that notion remained rather theoretical apart…

We show that the Dirichlet problem at infinity is unsolvable for the p-Laplace equation for any nonconstant continuous boundary data, for certain range of p>n, on an n-dimensional Cartan-Hadamard manifold constructed from a complete…

Let $\Delta+V$ be the discrete Schr\"odinger operator, where $\Delta$ is the discrete Laplacian on $\mathbb{Z}^d$ and potential $V:\mathbb{Z}^d\to \mathbb{C}$ is $\Gamma$-periodic with $\Gamma=q_1\mathbb{Z}\oplus q_2…

We define the periodic Full Kostant-Toda on every simple Lie algebra, and show its Liouville integrability. More precisely we show that this lattice is given by a Hamiltonian vector field, associated to a Poisson bracket which results from…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one:…

Let $p$ be a real number greater than one and let $G$ be a connected graph of bounded degree. In this paper we introduce the $p$-harmonic boundary of $G$. We use this boundary to characterize the graphs $G$ for which the constant functions…

The first non-zero Laplacian eigenvalue $\lambda_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $\kappa$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $\lambda_1=\kappa$ is…

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…

The already proved Lum-Chua's conjecture says that a continuous planar piecewise linear differential system with two zones separated by a straight line has at most one limit cycle. In this paper, we provide a new proof by using a novel…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

In this paper, we introduce a novel first-order derivative for functions on a lattice graph, which extends the discrete Laplacian and generalizes the theory of discrete PDEs on lattices. First, we establish the well-posedness of generalized…

In this paper, we study periodic linear systems on periodic time scales which include not only discrete and continuous dynamical systems but also systems with a mixture of discrete and continuous parts (e.g. hybrid dynamical systems). We…

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Models of discrete space and space-time that exhibit continuum-like behavior at large lengths could have profound implications for physics. They may tame the infinities that arise from quantizing gravity, and dispense with the machinery of…

A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…

In the first part of this article, we complete the program announced in the preliminary note [8] by proving a conjecture presented in [9] that states the equivalence of contractibility and p_{1}-stability for generalized spaces of formal…

We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…

We consider Laplacians on periodic metric graphs with unit-length edges. The spectrum of these operators consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite…

We explore Liouville's theorem and the Strong Liouville Property (SLP) for harmonic functions on Riemannian cones and surfaces. Our approach recasts the classical Liouville property in terms of the growth of radial eigenfunctions (in the…