Related papers: Constraint stability in permutations and action tr…
A probability-measure-preserving action of a countable group is called stable if its transformation-groupoid absorbs the ergodic hyperfinite equivalence relation of type II_1 under direct product. We show that for a countable group G and…
In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…
Let us say that a discrete countable group is stable if it has an ergodic, free, probability-measure-preserving and stable action. Let G be a discrete countable group with a central subgroup C. We present a sufficient condition and a…
We establish $\mathcal{Z}$-stability for crossed products of outer actions of amenable groups on $\mathcal{Z}$-stable $C^*$-algebras under a mild technical assumption which we call McDuff property with respect to invariant traces. We obtain…
Discrete stability extends the classical notion of stability to random elements in discrete spaces by defining a scaling operation in a randomised way: an integer is transformed into the corresponding binomial distribution. Similarly…
In this note we extend the concept of topological stability from homeomorphisms to group actions on compact metric spaces, and prove that if an action of a finitely generated group is expansive and has the pseudo-orbit tracing property then…
We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…
A measure-preserving action of a discrete countable group on a standard probability space is called stable if the associated equivalence relation is isomorphic to its direct product with the ergodic hyperfinite equivalence relation of type…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
We study stability of amalgamated free products and HNN extensions of stable groups over finite groups. We focus on operator norm stability, Hilbert-Schmidt stability and stability in permutations. We provide many new examples of stable (or…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
The original definition of amenability given by von Neumann in the highly non-constructive terms of means was later recast by Day using approximately invariant probability measures. Moreover, as it was conjectured by Furstenberg and proved…
We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple $(\sigma_1,\dotsc,\sigma_d)$ of permutations on $\{1,\dotsc,n\}$, and one wishes to determine whether this…
A solution to a given equation is structurally stable if it suffers only an infinitesimal change when the equation (not the solution) is perturbed infinitesimally. We have found that structural stability can be used as a velocity selection…
We study the notion of permutation stability (or P-stability) for countable groups. Our main result provides a wide class of non-amenable product groups which are not P-stable. This class includes the product group $\Sigma\times\Lambda$,…
We introduce the notion of tracial amenability for actions of discrete groups on unital, tracial C$^*$-algebras, as a weakening of amenability where all the relevant approximations are done in the uniform trace norm. We characterize tracial…
We introduce notions of a constraint metric approximation and of a constraint stability of a metric approximation. This is done in the language of group equations with coefficients. We give an example of a group which is not constraintly…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a…
In this paper we consider a general system of activities that can, but do not have to, occur. This system is governed by a set containing two types of constraints: precedence and response. A precedence constraint dictates that an activity…