Related papers: Geometric property (T) for box spaces and sofic ap…

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

We prove that closed manifolds admitting a generic metric whose sectional curvature is locally quasi-constant are graphs of space forms. In the more general setting of QC spaces where sets of isotropic points are arbitrary, under suitable…

If H is a flat group of automorphisms of finite rank n of a totally disconnected, locally compact group G, then each orbit of H in the metric space B(G) of compact, open subgroups of G is quasi-isometric to n-dimensional euclidean space. In…

Using the projection complex machinery, Bestvina-Bromberg-Fujiwara, Hagen-Petyt and Han-Nguyen-Yang prove that several classes of nonpositively-curved groups admit equivariant quasi-isometric embeddings into finite products of quasi-trees,…

We show, by an elementary and explicit construction, that the group of Hamiltonian diffeomorphisms of certain symplectic manifolds, endowed with Hofer's metric, contains subgroups quasi-isometric to Euclidean spaces of arbitrary dimension.

A locally compact group $G$ has property PL if every isometric $G$-action either has bounded orbits or is (metrically) proper. For $p>1$, say that $G$ has property $BP_{L^p}$ if the same alternative holds for the smaller class of affine…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

Kazhdan's property (T) has been studied for several discrete group-like structures, including standard invariants of Jones' subfactors and discrete quantum groups. We prove a Zuk-type spectral gap criterion for property (T) in this setting.…

We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…

A systolic complex/bridged graph is fit when its (metric) intervals are "not too large". We prove that uniformly locally finite fit systolic complexes have Yu's Property A. In particular, groups acting properly on such complexes have…

We prove that, for the free algebra over a sufficiently rich operad, a large subgroup of its group of tame automorphisms has Kazhdan's property (T). We deduce that there exists a group with property (T) that maps onto large powers of…

The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\} \] has interesting geometric properties. While it has a plentiful supply of complex geodesics and of automorphisms, there is nevertheless a unique complex geodesic…

Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. Suppose that X is infinite, connected and of bounded degree. A first-order sentence in the language of X is almost surely true…

A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…

In this paper, we prove that any graph product of finitely many groups, all satisfying the Haagerup property (or Gromov's a-T-menability) also satisfies Haagerup property.

We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…

If G is a group, a pseudocharacter f: G-->R is a function which is "almost" a homomorphism. If G admits a nontrivial pseudocharacter f, we define the space of ends of G relative to f and show that if the space of ends is complicated enough,…

We consider (projectively) linearly sofic groups, i.e. groups which can be approximated using (projective) matrices over arbitrary fields, as a generalization of sofic groups. We generalize known results for sofic groups and groups which…