Study of the divisor graph. IV (Q2214733)

A chain-permutation of the divisor graph of \(\mathbb{N}^*\) is a one-to-one mapping \(f: \mathbb{N}^*\rightarrow \mathbb{N}^*\) such that \(f(n)\) is a divisor or a multiple of \(f(n+1)\) for any positive integer \(n\). The main result of the paper says that there is a constant \(c_1\) and a chain-permutation of the divisor graph of \(\mathbb{N}^*\) such that \(f(n)\leq c_1n(\log n)^2\) for every \(n\geq 2\). This implies the existence of a constant \(c_2\) and a permutation of \(\mathbb{N}^*\) such that \(\operatorname{lcm}[f(n),f(n+1)]\leq c_2 n(\log n)^2\) for every \(n\geq 2\). This improves previous results of \textit{P. Erdős} et al. [Acta Math. Hung. 41, 169--176 (1983; Zbl 0518.10063)] and \textit{Y. G. Chen} and \textit{C. S. Ji} [Acta Math. Hung. 132, No. 4, 307--309 (2011; Zbl 1249.11001)].