Matching works

4 works

math.NT — Number Theory

A Fibonacci Analogue of the Fifteen Theorem

Contributed by Scott Kominers

We prove that a positive-definite quadratic form with integral Gram matrix represents every Fibonacci number if and only if it represents the first forty-two of them. The unique minimal criterion set consists of ten Fibonacci numbers, the largest of which is F42=267914296F_{42}=267914296.

A mix of human-written and AI-generated textHuman understanding: all partsFibonacci numberscongruence coversescalation methodquadratic formsternary quadratic formsuniversal formsuniversality criteria
Nov 12, 202637 pages
PDFView work

cs.CC — Computational Complexity

Class Numbers of Imaginary Quadratic Orders in the Polynomial Hierarchy

Contributed by Frank Vega

For d≥3d \geq 3 with −d≡0,1(mod4)-d \equiv 0, 1 \pmod 4, let h(−d)h(-d) be the number of classes of primitive positive definite binary quadratic forms of discriminant −d-d. We prove that d↦h(−d)d \mapsto h(-d) is computable in deterministic polynomial time with an oracle for a language in the second level Σ2P\Sigma_2^{\text{P}} of the polynomial hierarchy. The proof uses only reduction theory of binary quadratic forms, Lagrange's theorem and Hermite normal forms; it does not assume the generalized Riemann hypothesis, does not take a generating set of the class group as input, and uses no randomness. A Σ2P\Sigma_2^{\text{P}} oracle finds a generating set of O(log⁡d)O(\log d) forms, and an NP oracle then determines the lattice of relations, whose index is h(−d)h(-d). Consequently, if P=NP\text{P} = \text{NP}, class numbers of imaginary quadratic fields are computable in polynomial time. As an application, the number DnD_n of representations of nn by the ternary form 8x2+2y2+16z28x^2 + 2y^2 + 16z^2 in Tunnell's congruent number criterion equals 2h(−4n)2h(-4n) for square-free n≡2(mod8)n \equiv 2 \pmod 8 and vanishes for square-free n≡6(mod8)n \equiv 6 \pmod 8; hence DnD_n lies in FPΣ2P\text{FP}^{\Sigma_2^{\text{P}}} on even square-free nn, and an exact counting reduction from #SAT\#\text{SAT} to DnD_n would collapse the polynomial hierarchy to Δ3P\Delta_3^{\text{P}}.

Author comments: In this new version, we have added a computer-based numerical verification.

Primarily AI-generated textHuman understanding: all partsHermite normal formTunnell's theorembinary quadratic formsblack-box groupsclass numberscongruent numberscounting complexitypolynomial hierarchy
Nov 04, 20269 pages
PDFView work

math.NT — Number Theory

GRAM OBSERVATIONS AND THETA-SERIES RECONSTRUCTION OF EUCLIDEAN LATTICES

Contributed by Changxia Lin

A finite collection of lattice-vector lengths probes a positive-definite Gram matrix through rank-one linear functionals. We use this observation map to give a local criterion for non-identifiability and to construct an exact three-dimensional collision at a closed squared-length cutoff of one: two non-isometric lattices have identical complete truncated vector-length data, although their Gram determinants are different. A signed-cycle construction gives a higherdimensional family whose complete rank-one length multisets agree at every cutoff below an explicit threshold, with an exact first-shell discrepancy. We then turn to multi-vector data. The full degree-n Gram theta data determines every rank-n Euclidean lattice, by a basis-witness and covolume-index argument. On each compact subset of lattice moduli space, the same argument yields a finite cutoff; a determinant-one cusp family shows that the basis-witness cutoff supplied by this method cannot be uniform on the full moduli space. Finally, a published rank-32 theta-series coincidence, together with a minimum-shell spanning identity, is stabilized by orthogonal direct sums to every rank n ≥ 32. If k(n) denotes the least degree of full Gram theta data that universally determines rank-n Euclidean lattices, we obtain 4 ≤ k(n) ≤ n for n ≥ 32. The paper separates proved statements, cited lattice-theoretic input, and computational checks; it does not claim a solution of the exact minimum-degree problem.

Primarily human-written textHuman understanding: all parts
Nov 04, 202612 pages
PDFView work

math.NT — Number Theory

On the ternary pentagonal numbers conjecture

Contributed by Glenn Bruda

Communicated by Guy in 1994, the ternary pentagonal numbers conjecture of Blecksmith and Selfridge asserts that every integer larger than 3306633066 is the sum of three positive pentagonal numbers. Prior to this note, it was even unknown whether every sufficiently large integer is the sum of three positive pentagonal numbers. We resolve this in the affirmative, using the landmark work of Duke and Schulze-Pillot on ternary quadratic forms to handle all sufficiently large integers nn with v3(24n+3)≤8v_3(24n+3)\leq8, and present an explicit lift to handle the nn with v3(24n+3)≥9v_3(24n+3)\geq9.

Primarily human-written textHuman understanding: all partsPentagonal numbersalmost universalityternary quadratic forms
Oct 02, 20268 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations