Almost commuting permutations are near commuting permutations
Almost commuting permutations are near commuting permutations
复制标题
几乎通勤排列 接近通勤排列
DOI：
10.1016/j.jfa.2015.02.013
复制
发表时间：
2014
影响因子：
1.7
通讯作者：
Liviu Paunescu
中科院分区：
文献类型：
--
作者：
G. Arzhantseva;Liviu Paunescu
我们证明了交换子在具有汉明距离的排列中是稳定的，即几乎交换的两个排列接近两个交换排列。我们的结果扩展了几乎通勤排列的 tok 元组，对于任何给定的 k，并且允许限制，例如，甚至排列。
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 tok-tuples of almost commuting permutations, for any givenk, and allows restrictions, for instance, to even permutations.