Related papers: Coset correct means on groups and the probability …
Matching on covariates is a well-established framework for estimating causal effects in observational studies. The principal challenge stems from the often high-dimensional structure of the problem. Many methods have been introduced to…
A topological group $G$ is extremely amenable if every continuous action of $G$ on a compact space has a fixed point. Using the concentration of measure techniques developed by Gromov and Milman, we prove that the group of automorphisms of…
We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…
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…
Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union…
In this paper we introduce and study the concept of cyclic subgroup commutativity degree of a finite group $G$. This quantity measures the probability of two random cyclic subgroups of $G$ commuting. Explicit formulas are obtained for some…
Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov-Sinai entropy from the setting of amenable groups. Some parts…
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…
Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in…
The degree of commutativity of a group $G$ measures the probability of choosing two elements in $G$ which commute. There are many results studying this for finite groups. In [AMV17], this was generalised to infinite groups. In this note, we…
Grouped data are commonly encountered in applications. The Bernstein polynomial model is proposed as an approximate model in this paper for estimating a univariate density function based on grouped data. The coefficients of the Bernstein…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
We present a new probabilistic model of compact commutative Lie groups that produces invariant-equivariant and disentangled representations of data. To define the notion of disentangling, we borrow a fundamental principle from physics that…
The equivariant coarse Baum-Connes conjecture interpolates between the Baum-Connes conjecture for a discrete group and the coarse Baum-Connes conjecture for a proper metric space. In this paper, we study this conjecture under certain…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
Let $\mathbb G = (G, +)$ be a group (either abelian or not). Given $X, Y \subseteq G$, we denote by $\langle Y \rangle$ the subsemigroup of $\mathbb G$ generated by $Y$, and we set $$\gamma(Y) := \sup_{y_0 \in Y} \inf_{y_0 \ne y \in Y} {\rm…
In the present paper, we introduce a new concept of convexity which is generated by a family of endomorphisms of an Abelian group. In Abelian groups equipped with a translation invariant metric, we define the boundedness, the norm, the…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
We study amenability of definable and topological groups. Among our main technical tools is an elaboration on and strengthening of the Massicot-Wagner version of the stabilizer theorem, and some results around measures. As an application we…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…