Related papers: Amenability, Folner sets, and cooling functions

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

We establish a close link between the amenability of a unitary representation $\pi$ of a group $G$ (in the sense of Bekka) and the concentration property (in the sense of V. Milman) of the corresponding dynamical system $(\s_\pi,G)$, where…

This article is concerned with measure equivalence and uniform measure equivalence of locally compact, second countable groups. We show that two unimodular, locally compact, second countable groups are measure equivalent if and only if they…

We answer a question of Hegyv\'ari and Ruzsa concerning effective estimates of the Bohr-regularity of certain triple sums of sets with positive upper Banach densities in the integers. Our proof also works for any discrete amenable group,…

Conditional cooling-by-measurement holds a significant advantage over its unconditional (nonselective) counterpart in the average-population-reduction rate. However, it has a clear weakness with respect to the limited success probability of…

Classification is the task of predicting the class labels of objects based on the observation of their features. In contrast, quantification has been defined as the task of determining the prevalences of the different sorts of class labels…

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…

We provide a general criterion to deduce maximal amenability of von Neumann subalgebras $L\Lambda \subset L\Gamma$ arising from amenable subgroups $\Lambda$ of discrete countable groups $\Gamma$. The criterion is expressed in terms of…

We generalize Berg's notion of quasi-disjointness to actions of countable groups and prove that every measurably distal system is quasi-disjoint from every measure preserving system. As a corollary we obtain easy to check necessary and…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

We investigate amenability for $W^*$-Fell bundles over a discrete group $G$, with a focus on its characterization via approximation properties and conditional expectations. Building on the notion of $W^*$-amenability, we construct an…

We study properties of the Weyl pseudometric associated with an action of a countable amenable group on a compact metric space. We prove that the topological entropy and the number of minimal subsets of the closure of an orbit are both…

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

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…

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the…

We will give a criterion for the amenability of arbitrary locally finite trees. The criterion is based on the trimming operator which is defined on the space of trees. As an application, we obtain a necessary and sufficient condition for…

Traditional ranking algorithms are designed to retrieve the most relevant items for a user's query, but they often inherit biases from data that can unfairly disadvantage vulnerable groups. Fairness in information access systems (IAS) is…