Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Free metabelian groups are permutation stable
View through CrossRef
We prove that all finitely generated free metabelian groups are permutation stable by verifying that all invariant random subgroups of them are co-sofic. This partially answers to the question asked by Levit and Lubotzky whether all finitely generated metabelian groups are permutation stable. Our proof extends the range of application of Levit and Lubotzky’s method, which is used to show permutation stability of permutational wreath products of finitely generated abelian groups, to non-split and non-permutational metabelian groups.
European Mathematical Society - EMS - Publishing House GmbH
Title: Free metabelian groups are permutation stable
Description:
We prove that all finitely generated free metabelian groups are permutation stable by verifying that all invariant random subgroups of them are co-sofic.
This partially answers to the question asked by Levit and Lubotzky whether all finitely generated metabelian groups are permutation stable.
Our proof extends the range of application of Levit and Lubotzky’s method, which is used to show permutation stability of permutational wreath products of finitely generated abelian groups, to non-split and non-permutational metabelian groups.
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...
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. ...
Local permutation stability
Local permutation stability
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 in...
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 ...
Free polynilpotent groups and the Magnus property
Free polynilpotent groups and the Magnus property
Abstract
Motivated by a classic result for free groups, one says that a group
G has the Magnus property if the following holds: Whenever two
elements generate the sa...
Image encryption based on permutation polynomials over finite fields
Image encryption based on permutation polynomials over finite fields
In this paper, we propose an image encryption algorithm based on a permutation polynomial over finite fields proposed by the authors. The proposed image encryption process consists...