1. Setup and Definitions
For
define
Equivalently, minimize the quadratic form
Let be the set of minimizers of Q, and .
2. Geometric Framework: Lattices and Voronoi
Let
and
. The form
is strictly convex on
[
1][Chap. 1]. Lagrange multipliers give the unique continuous minimizer
Fix an integral particular solution
to
, and set
the homogeneous lattice (rank 2). A convenient basis is
since
and
. Every
can be written as
with
.
Lemma 1 (Reduction to CVP).
Let . Then
Thus equals the number of nearest neighbors
to in K under the metric Q (Voronoi cells) [2,3] [Ch. 21].
Lemma 2 (Ties ⇒ hyperplanes linear in
n).
For , the condition reduces to
where . Since is affine in n for large n, tie values form arithmetic progressions (Voronoi walls) [3,4].
Lemma 3 (Finite periodicity).
There is a period T with such that, for large n, the tie pattern (hence ) is T-periodic in n (nonnegativity affects only finitely many n) [7][Chap. V].
Theorem 1 (Asymptotic classification).
There exist and a finite set with such that, for all ,
In particular, asymptotically.
Proof. Combine Lemmas 1, 2, 3, and the fact that in rank 2 generic ties are binary (Voronoi walls between two cells) [
3]. □
3. Harmonic Proof: Lattice Theta and Poisson
For
and
define the theta series
For each n, take . A Gibbs concentration yields:
Lemma 4 (Concentration).
Let and
Then , with uniform convergence off walls.
Let
be the dual lattice under
Q. The
Poisson summation formula (see [
1][Sec. VII.2], [
5][Ch. 1], [
6][Ch. 4]) gives
with
.
Lemma 5 (Exact periodicity of phases).
Write with and (integral, 30-periodic). Then
As α has denominator 10 and is 30-periodic and integral, the phases are roots of unity and is exactly T-periodic for some .
Theorem 2 (Harmonic version of Theorem 1). For each , is T-periodic with and has a finite Fourier series over . Taking in of Lemma 4, we obtain that is T-periodic for and .
Remark 1 (Discrete spectrum).
The spectrum of is contained in rational frequencies (Fourier–Bohr) [5][Ch. 1].
4. Explicit Residues with (Evidence)
Exact computations indicate that, for sufficiently large
n, ties occur precisely on the classes
Computational fact. For
and all
n with
:
No instance with
was observed. This matches the Voronoi picture (binary ties in rank 2) and the harmonic periodicity (
Section 3). The refinement modulo 30 reflects that
and parities/periodicities of
depend on denominators dividing 10 and on
.
5. Arithmetic Observations
Observation 5.1 (Primes and external prime powers). In the verified ranges, for every prime we have , and for every prime power with we have . Theorem 1 explains that, up to finitely many small exceptions, this stabilizes for .
Remark 2 (On prior conjectures). Lower bounds of the form (with k the number of distinct prime factors of n) are not correct in general: the asymptotic structure is governed by modular periodicity (Voronoi/Poisson), not by factorization alone.
Appendix A. Reproducible Exact Code
|
Listing 1: Exact computation of m(n) via efficient enumeration |
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
def exact_min_solutions(n):
best = None
sols = []
for c in range(0, n//5 + 1):
r = n - 5*c
if r < 0:
break
# Parity: r - 3b even <=> r%2 == b%2
start_b = (r & 1)
for b in range(start_b, r//3 + 1, 2):
a_num = r - 3*b
if a_num < 0:
break
a = a_num // 2
nv = Nvar(a,b,c)
if (best is None) or (nv < best):
best = nv
sols = [(a,b,c)]
elif nv == best:
sols.append((a,b,c))
return sols # exact list of minimizers
# Example:
for n_test in [1000, 1004, 1015, 1026, 1031]:
sols = exact_min_solutions(n_test)
print(n_test, len(sols), sols[:4])
|
References
- J. W. S. Cassels, An Introduction to the Geometry of Numbers, Springer, 1959. (Fundamentals of geometry of numbers and Poisson on lattices.).
- P. M. Gruber, C. G. Lekkerkerker, Geometry of Numbers, 2nd ed., North-Holland, 1987. (Lattices, Voronoi cells, and geometric techniques.).
- J. H. Conway, N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Springer, 1999. (Lattice structures, nearest neighbors, and ties.).
- G. Voronoi, Recherches sur les parallélloèdres primitifs, J. Reine Angew. Math. 134 (1908), 198–287. (Classic foundation of Voronoi cells.).
- E. M. Stein, R. Shakarchi, Fourier Analysis: An Introduction, Princeton, 2003. (Poisson summation and Fourier analysis used here.).
- H. Iwaniec, E. Kowalski, Analytic Number Theory, AMS Colloquium, 2004. (Lattice theta and Poisson in analytic number theory.).
- G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., OUP, 2008. (Basic modular arithmetic and periodicity; context for T∣30.).
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).