English
Related papers

Related papers: Non-amenable products are not treeable

200 papers

Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…

Combinatorics · Mathematics 2023-04-07 Raju Nandi

If $N \subset \R$ is a separable II$_1$-factor, the space $\Hom(N,\R)$ of unitary equivalence classes of unital *-homomorphisms $N \to \R$ is shown to have a surprisingly rich structure. If $N$ is not hyperfinite, $\Hom(N,\R)$ is an…

Operator Algebras · Mathematics 2011-12-08 Nathanial P. Brown

We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…

Group Theory · Mathematics 2010-10-01 Christian Rosendal

We examine the completely isometric automorphisms of a free product of noncommutative disc algebras. It will be established that such an automorphism is given simply by a completely isometric automorphism of each component of the free…

Operator Algebras · Mathematics 2015-07-01 Christopher Ramsey

Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2. Using a result of Alon and Wormald, we show that there exists a natural number…

Combinatorics · Mathematics 2019-01-11 Kasper Szabo Lyngsie , Martin Merker

We prove that if two transvection-free right-angled Artin groups are measure equivalent, then they have isomorphic extension graphs. As a consequence, two right-angled Artin groups with finite outer automorphism groups are measure…

Group Theory · Mathematics 2022-06-15 Camille Horbez , Jingyin Huang

Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…

Group Theory · Mathematics 2014-12-18 Mathieu Carette

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

Group Theory · Mathematics 2018-06-22 Anush Tserunyan

In this article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization of group vertex magicness of trees of diameter up to 5. for…

Combinatorics · Mathematics 2023-02-22 Karthik S , M Sabeel K , K. Paramasivam

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…

Group Theory · Mathematics 2007-05-23 Victor Guba , Mark Sapir

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

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

Group Theory · Mathematics 2011-10-21 Maciej Malicki

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Combinatorics · Mathematics 2008-12-31 Alexander Dainiak

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Combinatorics · Mathematics 2025-05-16 J. Pascal Gollin , Jay Lilian Kneip

We give examples of rank-one transformations that are (weak) doubly ergodic and rigid (so all their cartesian products are conservative), but with non-ergodic $2$-fold cartesian product. We give conditions for rank-one infinite…

Dynamical Systems · Mathematics 2016-10-20 Isaac Loh , Cesar E. Silva

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…

Group Theory · Mathematics 2024-08-21 Rylee Alanza Lyman

A data tree is an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and an element ("datum") from an infinite set, where the latter can only be compared for equality. The article considers alternating…

Logic in Computer Science · Computer Science 2010-06-15 Marcin Jurdzinski , Ranko Lazic

The class of the Riemannian almost product manifolds with nonintegrable structure is considered. Some identities for curvature tensor as certain invariant tensors and quantities are obtained.

Differential Geometry · Mathematics 2009-07-14 Dimitar Mekerov

We prove that, if a discrete group $G$ is not inner amenable, then the unit group of the ring of operators affiliated with the group von Neumann algebra of $G$ is non-amenable with respect to the topology generated by its rank metric. This…

Operator Algebras · Mathematics 2025-03-04 Friedrich Martin Schneider

The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…

Discrete Mathematics · Computer Science 2017-02-28 Benoit Darties , Nicolas Gastineau , Olivier Togni