Bounded Factorial Diophantine Equations via Permutation Resonances

  • Mohammed Aassila Independent Researcher, F-67000 Strasbourg, France
Keywords: Diophantine equations, factorial identities, bounded integer sequences, permutations, resonance polynomials, derangements, numerical semigroups

Abstract

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.

Downloads

Download data is not yet available.

References

Bencze, M. (2013). OQ.4836. Octogon Mathematical Magazine, 24(2).

Bencze, M. (2013). OQ.4837. Octogon Mathematical Magazine, 24(2).

Bagdasar, O., Baker, A., & Conniss, R. (2017). Some remarks on OQ.4836 and OQ.4837. Octogon Mathematical Magazine, 25(1), 416–420.

Berend, D., & Harmse, J. E. (2006). On polynomial-factorial Diophantine equations. Transactions of the American Mathematical Society, 358(4), 1741–1779.

Novaković, S. (2025). A note on some polynomial-factorial Diophantine equations. Glasnik Matematički, 60(1), 21–38.

Novaković, S. (2026). Products of factorials which are products of factorials [Preprint]. arXiv:2602.23838. https://arxiv.org/abs/2602.23838

Diaconis, P., & Graham, R. L. (1977). Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society: Series B (Methodological), 39(2), 262–268.

Ramírez Alfonsín, J. L. (2005). The Diophantine Frobenius problem (Oxford Lecture Series in Mathematics and its Applications, Vol. 30). Oxford University Press.

Macdonald, I. G. (1995). Symmetric functions and Hall polynomials (2nd ed.). Oxford University Press.

Published
2026-11-16
How to Cite
Aassila, M. (2026). Bounded Factorial Diophantine Equations via Permutation Resonances. Earthline Journal of Mathematical Sciences, 17(1), 1-28. https://doi.org/10.34198/ejms.17127.01.0001