Permutations with arithmetic constraints

Abstract

We get upper and lower bounds for the counts of these sets, showing they grow geometrically. We also prove a conjecture from a recent paper on the number of "anti-coprime" permutations of [n], meaning that each gcd(j, π(j)) > 1 except when j = 1.