Related papers: Nonamenable Liouville Graphs
Benjamini and Schramm (1996) used circle packing to prove that every transient, bounded degree planar graph admits non-constant harmonic functions of finite Dirichlet energy. We refine their result, showing in particular that for every…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.
In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G satisfying certain isoperimetric inequality. Following the idea of W. Ding, we prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of any…
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs,…
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
In this paper, we study the Liouville--type theorems for three--dimensional stationary incompressible MHD and Hall--MHD systems in a slab with periodic boundary condition. We show that, under the assumptions that $(u^\theta,b^\theta)$ or…
We give a non-perturbative completion of a class of closed topological string theories in terms of building blocks of dual open strings. In the specific case where the open string is given by a matrix model these blocks correspond to a…
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…
Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…
We prove that for every graph H and for every integer s, the class of graphs that do not contain K_s, K_{s,s}, or any subdivision of H as an induced subgraph has bounded expansion; this strengthens a result of Kuhn and Osthus. The argument…
We enlarge the spectral problem of a generalized D-Kaup-Newell (D-KN) spectral problem. Solving the enlarged zero-curvature equations, we produce integrable couplings. A reduction of the spectral matrix leads to a second integrable coupling…
We obtain some Liouville type theorems for positive harmonic functions on compact Riemannian manifolds with nonnegative Ricci curvature and strictly convex boundary and partially verifies Wang's conjecture (J. Geom. Anal. 31 (2021)). For…
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and…
For a nonautonomous linear system with nonuniform contraction, we construct a topological equivalence between this system and an unbounded nonlinear perturbation. This topological equivalence is constructed as a composition of…
We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…
We investigate the existence of FIID homomorphisms from regular trees to finite graphs. Using entropy inequalities we show that there are graphs with arbitrarily large chromatic number to which there is no FIID homomorphism from a 3-regular…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
We improve bounds on the degree and sparsity of Boolean functions representing the Legendre symbol as well as on the $N$th linear complexity of the Legendre sequence. We also prove similar results for both the Liouville function for…
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…