Related papers: Unique continuation on planar graphs
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
This paper is on further development of discrete complex analysis introduced by R. Isaacs, J. Ferrand, R. Duffin, and C. Mercat. We consider a graph lying in the complex plane and having quadrilateral faces. A function on the vertices is…
As an application of Brouwer's fixed-point theorem we prove that a continuously differentiable convex function with gradient of constant norm is an affine mapping. It is a first-order characterization of affine mappings among continuously…
We show that any second order linear ordinary diffrential equation with constant coefficients (including the damped and undumped harmonic oscillator equation) admits an exact discretization, i.e., there exists a difference equation whose…
General properties of perturbed conformal field theory interacting with quantized Liouville gravity are considered in the simplest case of spherical topology. We discuss both short distance and large distance asymptotic of the partition…
In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction-diffusion equations.
We investigate discrete fractional Laplacians defined on the half-lattice in several dimensions, allowing possibly different fractional orders along each coordinate direction. By expressing the half-lattice operator as a boundary…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…
We prove several classification results for $p$-Laplacian problems on bounded and unbounded domains, and deal with qualitative properties of sign-changing solutions to $p$-Laplacian equations on $\mathbb R^N$ involving critical…
Starting from Sinclair's 1976 work {\it Automatic Continuity of Linear Operators}, Cambridge University Press, (1976), on automatic continuity of linear operators on Banach spaces, we prove that sequences of intertwining continuous linear…
Assume $\alpha\geq p>1$. Consider the following $p$-th Yamabe equation on a connected finite graph $G$: $$\Delta_p\varphi+h\varphi^{p-1}=\lambda f\varphi^{\alpha-1},$$ where $\Delta_p$ is the discrete $p$-Laplacian, $h$ and $f>0$ are fixed…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…
We prove several unique continuation results for biharmonic maps between Riemannian manifolds.
It is proved that every linear biseparating map between spaces of vector-valued differentiable functions is a weighted composition map. As a consequence, such a map is always continuous.
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…
Given an arbitrary planar $\infty$-harmonic function $u$, for each $\alpha>0$ we establish a quantitative local $W^{1,2}$-estimate of $|Du|^\alpha $, which is sharp as $\alpha\to0$. We also show that the distributional determinant of $u$ is…
For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…