On permutations π of {1,…,n} with i+π(i) a perfect square
Year: 2026
Type: preprint
Abstract: Let a(n) be the number of permutations π of {1,…,n} such that i+π(i) is a perfect square for every i (OEIS A095986). We study two questions. The first concerns block solutions: permutations obtained by cutting 1,…,n into consecutive blocks and reversing each block (OEIS A402123). We determine exactly for which n block solutions exist. Writing S(x) for the number of block solutions of size less than x, we prove ln S(x) ~ √2·ln φ·√x, where φ is the golden ratio. The second concerns all solutions. We prove ln a(n) = (1/2)·n·ln n + O(n), so Bregman's upper bound is sharp in the leading term. The lower bound comes from an explicit doubly stochastic matrix supported on the pattern {(i,j): i+j is a square}. The key step is the spectral estimate λ_min ≥ −1/√2 − o(1), proved with the circle method. AI tools (Claude, Gemini, Grok) were used during this research; see the section "Use of AI tools" in the paper. Verification code: https://github.com/zulfumirza/square-sum-permutations
Author: Gür, Zülfü Mirza
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236317252
