Permutations with arithmetic constraints

TL;DR

This paper investigates permutations constrained by arithmetic conditions involving least common multiples and divisibility, providing bounds on their counts and confirming a conjecture about anti-coprime permutations.

Contribution

It establishes bounds for permutations with lcm and divisibility constraints and proves a conjecture on anti-coprime permutations.

Findings

Counts grow geometrically for both sets

Bounds are derived for the number of such permutations

Conjecture on anti-coprime permutations is proved

Abstract

Let $S_{\rm lcm}(n)$ denote the set of permutations $\pi$ of $[n]=\{1,2,\dots,n\}$ such that ${\rm lcm}[j,\pi(j)]\le n$ for each $j\in[n]$. Further, let $S_{\rm div}(n)$ denote the number of permutations $\pi$ of $[n]$ such that $j\mid\pi(j)$ or $\pi(j)\mid j$ for each $j\in[n]$. Clearly $S_{\rm div}(n)\subset S_{\rm lcm}(n)$. 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,\pi(j))>1$ except when $j=1$.