Related papers: Metric criteria for fixed price of countable group…

We prove that for every finitely generated group $\Gamma$, at least one of the following holds: (1) $\Gamma$ has fixed price; (2) each of its Cayley graphs $G$ has infinitely many infinite clusters for some Bernoulli percolation on $G$.

We prove that the product of any two infinite countable groups has fixed price one. This resolves a longstanding problem posed by Gaboriau. The proof uses the propagation method to construct a Poisson horoball process as a weak limit of a…

Fixing a subgroup $\Gamma$ in a group $G$, the full commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] \leq n$. For…

A countable group \Gamma is called shift-minimal if every non-trivial measure preserving action of \Gamma weakly contained in the Bernoulli shift of \Gamma on ([0,1]^\Gamma ,\lambda ^\Gamma) is free. We show that any group \Gamma whose…

Let $G_1$ be a semisimple real Lie group and $G_2$ another locally compact second countable unimodular group. We prove that $G_1 \times G_2$ has fixed price one if $G_1$ has higher rank, or if $G_1$ has rank one and $G_2$ is a $p$-adic…

A discrete countable group \Gamma is said to be ME rigid if any discrete countable group that is measure equivalent to \Gamma is virtually isomorphic to \Gamma. In this paper, we construct ME rigid groups by amalgamating two groups…

We discuss a Plancherel formula for countable groups, which provides a canonical decomposition of the regular representation of such a group $\Gamma$ into a direct integral of factor representations. Our main result gives a precise…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

Suppose we have two finitely supported, admissible, probability measures on a hyperbolic group $\Gamma$. In this article we prove that the corresponding two Green metrics satisfy a counting central limit theorem when we order the elements…

We prove that every countably infinite group with Kazhdan's property (T) has cost 1, answering a well-known question of Gaboriau. It remains open if they have fixed price 1.

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

Let $\C(\Gamma)$ be the set of isomorphism classes of the finite groups that are homomorphic images of $\Gamma$. We investigate the extent to which $\C(\Gamma)$ determines $\Gamma$ when $\Gamma$ is a group of geometric interest. If…

We study Measurable Imbeddability between groups, which is an order-like generalization of Measure Equivalence that allows the imbedded group to have an infinite measure fundamental domain. We prove if $\Lambda_1$ measurably imbeds into…

A group $\Gamma$ is said to be uniformly HS stable if any map $\varphi : \Gamma \to U(n)$ that is almost a unitary representation (w.r.t. the Hilbert Schmidt norm) is close to a genuine unitary representation of the same dimension. We…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

For a finitely generated group $\Gamma$ denote by $\mu(\Gamma)$ the growth coefficient of $\Gamma$, that is, the infimum over all real numbers $d$ such that $s_n(\Gamma)<n!^d$. We show that the growth coefficient of a virtually free group…

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

Fixing a subgroup $\Gamma$ in a group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] = n$. For pairs…

In the book [FIM], original methods were proposed to determine the invariant measure of random walks in the quarter plane with small jumps, the general solution being obtained via reduction to boundary value problems. Among other things, an…

A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…