Bounded Factorial Diophantine Equations via Permutation Resonances
Let $P\in\mathbb Z[x]$. We study when nonzero integers $x_1,x_2,\ldots$, uniformly bounded in absolute value, can satisfy \[ \prod_{k=1}^n\left(k+\frac{P(k)}{x_k}\right)=n! \] for infinitely many $n$. A degree obstruction forces $\deg P\le1$, and the two homogeneous affine cases are solved explicitly. For a genuinely mixed affine polynomial $P(x)=ax+b$, we develop a periodic block-rescaling construction governed by a permutation $\sigma\in S_L$, leading to the resonance polynomial \[ R_\sigma(t)=\prod_{r=1}^L(1-td_r)-1, \qquad d_r=\sigma(r)-r. \] We isolate the additional integrality and nonvanishing requirements by introducing the notion of an \emph{admissible resonance}. We show that $0$ is always a double root, establish a reflection symmetry, and reformulate $R_\sigma$ in terms of elementary symmetric functions of the displacement vector. An exhaustive exact search through block length $9$ identifies the first rational resonances and shows that $L=2,4,7$ are barren, while a partial search at length $10$ finds further examples. We prove an exact direct-sum law for resonance polynomials and use coprime witness lengths to obtain \emph{cofinite realization} theorems: a slope realized at two coprime admissible block lengths is realized at every sufficiently large length, with one fixed admissible pair $(a,b)$. We give a closed-form proof that block length $4$ is barren, and show that the master construction cannot produce a mixed affine example when $b=\pm1$. The paper concludes with conjectures and open questions concerning the full bounded sequence problem beyond the periodic block-rescaling framework.
Authors
- Mohammed Aassila (ORCID: https://orcid.org/0009-0007-9526-8497)
Publication Details
- Journal
- Earthline Journal of Mathematical Sciences
- Published
- 2026-11-16
- DOI
- https://doi.org/10.34198/ejms.17127.01.0001
- Primary Topic
- Algebraic Geometry and Number Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00