On permutations π of {1,…,n} with i+π(i) a perfect square

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

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24334781
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On permutations π of {1,…,n} with i+π(i) a perfect square

Zülfü Mirza Gür
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

On permutations π of {1,…,n} with i+π(i) a perfect square

Zülfü Mirza Gür
preprint en

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

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon