English
Related papers

Related papers: Lipschitz harmonic functions on vertex-transitive …

200 papers

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Combinatorics · Mathematics 2026-01-19 Angelo El Saliby

In this note we define L-functions of finite graphs and study the particular case of finite cycles in the spirit of a previous paper that studied spectral zeta functions of graphs. The main result is a suggestive equivalence between an…

Number Theory · Mathematics 2016-01-19 Fabien Friedli

Indecomposible semifinite harmonic functions on the direct product of graded graphs are classified. As a particular case, the full list of indecomposible traces for the infinite inverse symmetric semigroup is obtained.

Representation Theory · Mathematics 2022-09-15 Pavel Nikitin , Nikita Safonkin

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

Combinatorics · Mathematics 2012-11-13 Endre Csoka , Gabor Lippner

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…

Combinatorics · Mathematics 2016-09-07 Alexei Borodin , Grigori Olshanski

For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\to\{1,2\ldots,k\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\in\{1,\ldots,k\}$. The…

Combinatorics · Mathematics 2017-05-31 Niranjan Balachandran , Sajith Padinhatteeri , Pablo Spiga

A compactly generated group is noncompact if and only if it admits a nonconstant harmonic function (for some, equivalently for every, reasonable measure). This generalizes the known fact that a finitely generated group is infinite if and…

Group Theory · Mathematics 2022-01-13 Darren Creutz

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

Liv\v{s}ic theorem for flows asserts that a Lipschitz observable that has zero mean average along every periodic orbit is necessarily a coboundary, that is the Lie derivative of a Lipschitz function smooth along the flow direction. The…

Dynamical Systems · Mathematics 2024-06-27 Xifeng Su , Philippe Thieullen

We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…

Combinatorics · Mathematics 2018-12-03 Jack E. Graver , Mark E. Watkins

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

Combinatorics · Mathematics 2011-02-04 Primoz Potocnik , Pablo Spiga , Gabriel Verret

In this paper we prove a new subconvexity result for the standard L-function of a unitary cuspidal automorphic representation $\pi$ of $\text{GL}_n$, where the finite set of places $S$ with large conductors is allowed to vary, provided that…

Number Theory · Mathematics 2025-03-18 Yueke Hu , Paul Nelson

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

Probability · Mathematics 2014-10-10 He Song , Kai-Nan Xiang , Song-Chao-Hao Zhu

Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…

Machine Learning · Computer Science 2022-02-07 Tim Roith , Leon Bungert

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Combinatorics · Mathematics 2025-10-23 Sandra Albrechtsen , Matthias Hamann

A vertex-transitive graph $\mathcal{G}$ is called Local-to-Global rigid if there exists $R>0$ such that every other graph whose balls of radius $R$ are isometric to the balls of radius $R$ in $\mathcal{G}$ is covered by $\mathcal{G}$. An…

Group Theory · Mathematics 2023-01-05 Amandine Escalier

We show that every irreducible representation in the discrete automorphic spectrum of GL(n) admits a non vanishing mixed (Whittaker-symplectic) period integral. The analog local problem is a study of models first considered by Klyachko over…

Representation Theory · Mathematics 2007-10-19 Omer Offen , Eitan Sayag

Let \Omega\subset\mathbb{R}^n be a bounded domain with C^\infty boundary. We show that a harmonic function in \Omega that is Lipschitz along a family of curves transversal to b\Omega is Lipschitz in \Omega. The space of Lipschitz functions…

Analysis of PDEs · Mathematics 2015-04-14 Sivaguru Ravisankar

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

Combinatorics · Mathematics 2011-01-13 Matthias Hamann
‹ Prev 1 3 4 5 6 7 10 Next ›