English
Related papers

Related papers: Geometric amenability in totally disconnected loca…

200 papers

We show that every abstract homomorphism $\varphi$ from a locally compact group $L$ to a graph product $G_\Gamma$, endowed with the discrete topology, is either continuous or $\varphi(L)$ lies in a 'small' parabolic subgroup. In particular,…

Group Theory · Mathematics 2019-08-14 Linus Kramer , Olga Varghese

This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski,…

Group Theory · Mathematics 2016-03-15 Tullio Ceccherini-Silberstein , Rostislav I. Grigorchuk , Pierre de la Harpe

Let $G$ be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface $X \subseteq \mathbb{S}^2$. We prove that $G$ admits such an action that is in addition co-compact, provided we can…

Combinatorics · Mathematics 2019-05-17 Agelos Georgakopoulos

Let $\phi: G \rightarrow H$ be a group homomorphism such that $H$ is a totally disconnected locally compact (t.d.l.c.) group and the image of $\phi$ is dense. We show that all such homomorphisms arise as completions of $G$ with respect to…

Group Theory · Mathematics 2018-01-04 Colin D. Reid , Phillip R. Wesolek

We study skew-amenable topological groups, i.e., those admitting a left-invariant mean on the space of bounded real-valued functions left-uniformly continuous in the sense of Bourbaki. We prove characterizations of skew-amenability for…

Group Theory · Mathematics 2022-04-22 Kate Juschenko , Friedrich Martin Schneider

In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…

General Topology · Mathematics 2018-06-18 Serhii Bardyla

We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…

Group Theory · Mathematics 2021-09-24 François Le Maître

In this paper we prove a general convergence theorem for almost-additive set functions on unimodular, amenable groups. These mappings take their values in some Banach space. By extending the theory of epsilon-quasi tiling techniques, we set…

Dynamical Systems · Mathematics 2017-10-26 Felix Pogorzelski

A group, $\fl{H}$, of automorphisms of a totally disconnected locally compact group, $G$, is flat if there is a compact open $U\leq G$ such that the index $[\alpha(U):U\cap \alpha(U)]$ is mininimized for every $\alpha\in\fl{H}$. The…

Group Theory · Mathematics 2025-12-12 George A. Willis

A measure-scaling quasi-isometry between two connected graphs is a quasi-isometry that is quasi-$\kappa$-to-one in a natural sense for some $\kappa>0$. For non-amenable graphs, all quasi-isometries are quasi-$\kappa$-to-one for any…

Group Theory · Mathematics 2021-05-12 Anthony Genevois , Romain Tessera

Extended admissible groups belong to a particular class of graphs of groups that admit a decomposition generalizing those of non-geometric 3-manifold groups and Croke-Kleiner admissible groups. In this paper, we study several…

Group Theory · Mathematics 2026-01-01 Toan Trong Dao , Hoang Thanh Nguyen

Rajchman measures of locally compact Abelian groups are studied for almost a century now, and they play an important role in the study of trigonometric series. Eymard's influential work allowed generalizing these measures to the case of…

Functional Analysis · Mathematics 2011-02-15 Mahya Ghandehari

We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…

Group Theory · Mathematics 2021-10-29 Sam Shepherd , Daniel J. Woodhouse

We establish several new characterizations of amenable $W^*$- and $C^*$-dynamical systems over arbitrary locally compact groups. In the $W^*$-setting we show that amenability is equivalent to (1) a Reiter property and (2) the existence of a…

Operator Algebras · Mathematics 2020-08-25 Alex Bearden , Jason Crann

In this paper we provide a necessary and sufficient condition for the amenability of the automorphism group of Fra\"iss\'e structures and apply it to prove the non-amenability of the automorphism groups of the directed graph $\mathbf{S}(3)$…

Logic · Mathematics 2014-02-28 Andy Zucker

We state conditions for which a definable local homomorphism between two locally definable groups $\mathcal{G}$, $\mathcal{G^{\prime}}$ can be uniquely extended when $\mathcal{G}$ is simply connected (Theorem 2.1). As an application of this…

Logic · Mathematics 2021-01-26 Eliana Barriga

We prove that weak amenability of a locally compact group imposes a strong condition on its amenable closed normal subgroups. This extends non weak amenability results of Haagerup (1988) and Ozawa--Popa (2010). A von Neumann algebra…

Operator Algebras · Mathematics 2015-01-14 Narutaka Ozawa

It is shown that for a locally compact group $G$, if $L^{1}(G)^{**}$ is approximately weakly amenable, then $M(G)$ is approximately weakly amenable. Then, new notions of approximate weak amenability and approximate cyclic amenability for…

Functional Analysis · Mathematics 2015-06-10 Behrouz Shojaee , Abasalt Bodaghi

Let $K$ denote a locally compact commutative hypergroup, $L^1(K)$ the hypergroup algebra, and $\alpha$ a real-valued hermitian character of $K$. We show that $K$ is $\alpha$-amenable if and only if $L^1(K)$ is $\alpha$-left amenable. We…

Functional Analysis · Mathematics 2009-04-01 Ahmadreza Azimifard

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Computational Complexity · Computer Science 2015-05-05 V. Arvind , Johannes Köbler , Gaurav Rattan , Oleg Verbitsky