English
Related papers

Related papers: Nonamenable Liouville Graphs

200 papers

Assume that $f$ is Dunkl polyharmonic in $\mathbb{R}^n$ (i.e. $(\Delta_h)^p f=0$ for some integer $p$, where $\Delta_h$ is the Dunkl Laplacian associated to a root system $R$ and to a multiplicity function $\kappa$, defined on $R$ and…

Classical Analysis and ODEs · Mathematics 2008-11-07 Guangbin Ren , Liang Liu

Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct…

Probability · Mathematics 2007-05-23 Robin Pemantle , Yuval Peres

We prove a Liouville-type theorem for biharmonic maps from a complete Riemannian manifold of dimension \(n\) that has a lower bound on its Ricci curvature and positive injectivity radius into a Riemannian manifold whose sectional curvature…

Differential Geometry · Mathematics 2018-08-03 Volker Branding

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

Combinatorics · Mathematics 2025-10-28 Kieran Bhaskara , Michael Y. C. Chong , Takayuki Hibi , Naveena Ragunathan , Adam Van Tuyl

We show that if a non-amenable, quasi-transitive, unimodular graph $G$ has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and outdegree. This result involves extending earlier…

Probability · Mathematics 2023-08-15 Ferenc Bencs , Aranka Hrušková , László Márton Tóth

We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Combinatorics · Mathematics 2016-01-22 Lucas Hosseini , Patrice Ossona de Mendez

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Combinatorics · Mathematics 2024-07-09 Jesús Arturo Jiménez González , Andrzej Mróz

Let $u$ be a pluriharmonic function on the unit ball in $\mathbb{C}^n$. I consider the relationship between the set of points $L_u$ on the boundary of the ball at which $u$ converges nontangentially and the set of points $\mathcal{L}_u$ at…

Probability · Mathematics 2007-05-23 Steve Tanner

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially…

Data Structures and Algorithms · Computer Science 2016-08-31 Martin Gronemann

We prove that foliations on the projective plane admitting a Liouvillian first integral but not admitting a rational first integral always have invariant algebraic curves of degree bounded by a function of the degree of the foliation. We…

Algebraic Geometry · Mathematics 2018-04-20 Gaël Cousin , Alcides Lins Neto , Jorge Vitório Pereira

Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite…

Combinatorics · Mathematics 2010-06-01 Itai Benjamini , Van Cyr , Eviatar B. Procaccia , Ran J. Tessler

We prove that the class of chordal graphs is easily testable in the following sense. There exists a constant $c>0$ such that, if adding/removing at most $\epsilon n^2$ edges to a graph $G$ with $n$ vertices does not make it chordal, then a…

Combinatorics · Mathematics 2019-02-19 Rémi de Joannis de Verclos

A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\times…

Computational Geometry · Computer Science 2016-11-29 Therese Biedl , Claire Pennarun

We present a new, short and independent proof of the Liouville-type theorem for entire and subharmonic functions of finite order bounded outside some set of zero planar density.

Complex Variables · Mathematics 2020-09-03 Bulat N. Khabibullin

The Liouville theorem states that bounded holomorphic complex functions are necessarily constant. Holomorphic functions fulfill the socalled Cauchy-Riemann (CR) conditions. The CR conditions mean that a complex $z$-derivative is independent…

Neural and Evolutionary Computing · Computer Science 2013-06-10 Eckhard Hitzer

Let $L$ be a L\'evy operator. A function $h$ is said to be harmonic with respect to $L$ if $L h = 0$ in an appropriate sense. We prove Liouville's theorem for positive functions harmonic with respect to a general L\'evy operator $L$: such…

Analysis of PDEs · Mathematics 2024-11-28 Tomasz Grzywny , Mateusz Kwaśnicki

We construct nontrivial deformations of the standard map which preserve the symplectic actions, respectively the Lyapunov exponents, of infinitely many periodic orbits accumulating to an invariant curve. The proof uses a resonant…

Dynamical Systems · Mathematics 2025-12-04 Yunzhe Li

We prove that for any finite tree $T$ with $n$ vertices and maximal degree $3$, there is a topological embedding of $T$ into the integer grid $Z^2$ which maps vertices to vertices and whose image meets at most $\frac{7}{3}n$ vertices. This…

Metric Geometry · Mathematics 2024-01-29 Samuel Kelly

We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…

Combinatorics · Mathematics 2013-09-19 Florian Lehner