A short note on Layman permutations (Q2685418)

From the Introduction: ``Sequence \((F_i)_{i=0}^\infty\) is the Fibonacci sequence defined as \(F_n =F_{n-1} + F_{n-2}\) \((n\geq 2)\) with \(F_0=0\) and \(F_1=1\). We refer to \(F_2<F_3< F_4<\dots\) as Fibonacci numbers. These numbers \[1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, \dots\] are the initial object of essential mathematical research. Also, many deep results in mathematics use them to solve central open problems. For example, the solution to Hilbert's tenth problem, or designing complex data structures for important algorithms relies on properties of Fibonacci numbers. Many mathematical concepts are related to Fibonacci numbers. Enumerating special permutations leads to the sequence \((F_i)_{i=0}^\infty\): The set of permutations with \(|\sigma(i)-i|\leq 1\) for all \(i=1,\dots,n\) is called the set of Fibonacci permutations. Investigating these has proved very fruitful. Permutation polynomials can also be linked to Fibonacci numbers. [...] Layman introduced a special property of permutations (hereafter referred to as Layman's property) which is also related to Fibonacci numbers. Such permutations are henceforth called Layman permutations. A permutation \(p\) of \([k]=\{1,2,3,\dots,k\}\) is called Layman permutation iff \(i+p(i)\) is a Fibonacci number for all \(1\leq i\leq k\).'' This concept is introduced by Layman in the A097082 entry of the Encyclopedia of Integers Sequences, that is ``the number of Layman permutations of \([n]\)''. In the paper under review, the author studies Layman permutations and defines the notion of the Fibonacci complement of a natural number, which plays a crucial role in this investigation. He proves that as Observation 1: For all positive natural numbers \(n\) the set \([n]\) has a Layman permutation. Using this notion, the author proves some results on the number of Layman permutations, related to a conjecture of Layman that is implicit in the A097083 entry of OEIS. The author provides Conjecture 1 which is a nice, important conjecture and has a graph theoretical interpretation about bipartite graphs with a unique perfect matching.