Constraint metric approximations and equations in groups

We consider the centralizer equation in permutations as an instance of this new general setting. We characterize permutations p∈Sk whose centralizer is stable in permutations with respect to the normalized Hamming distance, that is, a permutation which almost centralizes p is near a centralizing permutation. This answers a question of Gorenstein-Sandler-Mills (1962).