Related papers: Constraint metric approximations and equations in …
We study stability of metric approximations of countable groups with respect to groups endowed with ultrametrics, the main case study being a $p$-adic analogue of Ulam stability, where we take $GL_n(\mathbb{Z}_p)$ as approximating groups…
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 provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, showing that every hyperlinear approximation to such a group is essentially produced from a sofic approximation. This…
Let $G$ be a sofic group, and let $\Sigma = (\sigma_n)_{n\geq 1}$ be a sofic approximation to it. For a probability-preserving $G$-system, a variant of the sofic entropy relative to $\Sigma$ has recently been defined in terms of sequences…
We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…
We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…
Sofic groups generalise both residually finite and amenable groups, and the concept is central to many important results and conjectures in measured group theory. We introduce a topological notion of a sofic boundary attached to a given…
Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…
We define a generalization of the fixed point set, called the bounded fixed set, for a group acting by isometries on a metric space. An analogue of the P. A. Smith theorem is proved for metric spaces of finite asymptotic dimension, which…
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
Several well-known open questions (such as: are all groups sofic/hyperlinear?) have a common form: can all groups be approximated by asymptotic homomorphisms into the symmetric groups $\mathrm{Sym}(n)$ (in the sofic case) or the finite…
An action trace is a function naturally associated to a probability measure preserving action of a group on a standard probability space. For countable amenable groups, we characterise stability in permutations using action traces. We…
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…
We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, effectively showing how every hyperlinear approximation to such a group is simulated by a suitable sofic approximation. The…
We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients…
A new framework for deriving equations of motion for constrained quantum systems is introduced, and a procedure for its implementation is outlined. In special cases the framework reduces to a quantum analogue of the Dirac theory of…
We seek an analog for the quantum permutation group $S_n^+$ of the normalized Hamming distance for permutations. We define three distances on the tracial state space of $C(S_n^+)$ that generalize the $L^1$-Wasserstein distance of…
In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
We find asymptotic equalities for exact upper bounds of approximations by Fourier sums in uniform metric on classes of $2\pi$-periodic functions, representable in the form of convolutions of functions $\varphi$, which belong to unit balls…