Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Local permutation stability

View through CrossRef
We introduce a notion of “local stability in permutations” for finitely generated groups. If a group is sofic and locally stable in our sense, then it is also locally embeddable into finite groups. Our notion is weaker than the “permutation stability” introduced by Glebsky–Rivera and Arzhantseva–Paunescu, which allows one to upgrade soficity to residual finiteness. We prove a necessary and sufficient condition for a finitely generated amenable group to be locally permutation stable, in terms of invariant random subgroups (IRSs), inspired by a similar criterion for permutation stability due to Becker, Lubotzky, and Thom. We apply our criterion to prove that derived subgroups of topological full groups of Cantor minimal subshifts are locally stable, using Zheng’s classification of IRSs for these groups. This last result provides continuum-many groups which are locally stable, but not stable.
European Mathematical Society - EMS - Publishing House GmbH
Title: Local permutation stability
Description:
We introduce a notion of “local stability in permutations” for finitely generated groups.
If a group is sofic and locally stable in our sense, then it is also locally embeddable into finite groups.
Our notion is weaker than the “permutation stability” introduced by Glebsky–Rivera and Arzhantseva–Paunescu, which allows one to upgrade soficity to residual finiteness.
We prove a necessary and sufficient condition for a finitely generated amenable group to be locally permutation stable, in terms of invariant random subgroups (IRSs), inspired by a similar criterion for permutation stability due to Becker, Lubotzky, and Thom.
We apply our criterion to prove that derived subgroups of topological full groups of Cantor minimal subshifts are locally stable, using Zheng’s classification of IRSs for these groups.
This last result provides continuum-many groups which are locally stable, but not stable.

Related Results

A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
Abstract To improve the image transmission security, an image encryption algorithm based on double permutation with random diffusion is proposed in this paper. This algorit...
ECONOMIC ESSENCE OF THE FINANCIAL STABILITY OF THE BANKING SYSTEM
ECONOMIC ESSENCE OF THE FINANCIAL STABILITY OF THE BANKING SYSTEM
Introduction. The article examines the essence of financial stability and stability of the banking system in order to analyze and understand them. The main approaches to interpreti...
New structure of algebras using permutations in symmetric groups
New structure of algebras using permutations in symmetric groups
The permutation BG-algebras were first introduced as a novel kind of algebra. In this work, their basic qualities were investigated to better understand how they relate to one anot...
ADVANTAGES OF PERMUTATION (RANDOMIZATION) TESTS IN CLINICAL AND EXPERIMENTAL PHARMACOLOGY AND PHYSIOLOGY
ADVANTAGES OF PERMUTATION (RANDOMIZATION) TESTS IN CLINICAL AND EXPERIMENTAL PHARMACOLOGY AND PHYSIOLOGY
SUMMARY1. The statistical procedures that are used most commonly in clinical and experimental pharmacology and physiology are designed to test for differences between two means.2. ...
Introducing: Second-order permutation
Introducing: Second-order permutation
In this study we answer questions that have to do with finding out the total number of ways of arranging a finite set of symbols or objects directly under a single line constraint ...
METHODICAL SET OF INSTRUMENTS FOR ESTIMATING FINANCIAL STABILITY OF LOCAL BUDGETS IN UKRAINE
METHODICAL SET OF INSTRUMENTS FOR ESTIMATING FINANCIAL STABILITY OF LOCAL BUDGETS IN UKRAINE
Introduction. In Ukraine, substantial structural reforms have been realized for last years. The necessity to provide financial stability of local budgets sets up new demands for th...
Analysis of the Complexity of Heuristic Algorithms for Permutation Optimization in Large-Scale Computing
Analysis of the Complexity of Heuristic Algorithms for Permutation Optimization in Large-Scale Computing
Permutation optimization is a fundamental problem in large-scale computing that arises in various applications such as scheduling, resource allocation, and combinatorial decision-m...

Back to Top