Matching works

8 works

math.NT — Number Theory

Regularity criteria and an effective bound for irregular extensions of Euler triples

Contributed by Sinisa Slijepcevic, Andrej Dujella

An Euler triple is a Diophantine triple {a,b,c}\{a,b,c\} with a<b<c=a+b+2ab+1a<b<c=a+b+2\sqrt{ab+1}. It extends to the regular Diophantine quadruple {a,b,c,d+}\{a,b,c,d_+\}, and it is conjectured that it has no other extension d>cd>c. We prove that an irregular extension forces c<4⋅1048c<4\cdot10^{48}, against c<1098c<10^{98} in recent work of He and Togb\'e. The proof squeezes the index mm of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4c<8m^4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/ab/a, which confines irregular extensions to 1+11538<b/a<335521+\frac1{1538}<b/a<3355^2; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:kj:k with jk≤300jk\le300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2\nu A\ge2 and K≥643K\ge643, and when K=1K=1, A∈{2,3}A\in\{2,3\} and ν≥2\nu\ge2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>cd>c.

A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Nov 13, 202672 pages
PDFView work

math.NT — Number Theory

A congruence obstruction to Ibn al-Khawwām’s eleventh problem

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that there are no two rational squares whose sum is ten and such that adding its own square root to each gives another rational square. This is the existence question in Ibn al-Khawwām’s eleventh arithmetic problem. The proof uses only the residues of squares modulo three and a divisibility argument.

Primarily AI-generated textHuman understanding: some partsDiophantine equationsIbn al-Khawwamcongruencesrational squares
Nov 12, 20262 pages
PDFView work

math.DS — Dynamical Systems

Non-perpendicular periodic orbits in mirror directions of right triangles

Contributed by Joshua Boorstein

Let TT be a right triangle with an acute angle aa. A direction is a mirror direction of TT if it is the axis of a reflection in the group generated by the reflections in the sides of TT — for instance, any direction parallel or perpendicular to a side. A billiard path that meets a side at a right angle retraces itself, its directions are mirror directions, and it is periodic as soon as it meets a side at a right angle a second time. We ask whether every periodic billiard path in a mirror direction is of this kind. When cos⁡2a\cos 2a is transcendental it is: every such path meets a side at a right angle, and in the directions parallel to the hypotenuse there is no periodic path at all. The proof is a holonomy computation on Hooper's chain of rhombi, and it bounds the degree of cos⁡2a\cos 2a for any exception. When cos⁡2a\cos 2a is algebraic and a/πa/\pi irrational, exceptions can occur: we construct non-perpendicular periodic cylinders in mirror directions explicitly — among them an infinite family indexed by the solutions of u2−2v2=−1u^2 - 2v^2 = -1 — and show that the triangles carrying them form a countable dense set in each of the four classes of mirror directions. Corollaries include the absence of odd-period orbits in right triangles and the existence of one-way periodic paths in every right triangle (answering two questions of Holt), a description of the odd orbits of isosceles triangles, and the statement that Ruijgrok's third conjecture, read for right triangles, fails on a countable dense set of triangles, all with cos⁡2a\cos 2a algebraic, and holds whenever cos⁡2a\cos 2a is transcendental.

Author comments: First version. Companion paper: "The necklace of a rational right triangle" (hexagon:2611.00213). Code: https://doi.org/10.5281/zenodo.24037744

Primarily AI-generated textHuman understanding: some partsHooper's rhombiRuijgrok's conjecturebilliardsholonomyirrational billiardsmirror directionsodd-period orbitsperiodic orbitsperpendicular orbitsright triangles
Nov 11, 202635 pages
PDFView work

math.NT — Number Theory

Polynomial parametrization of quadratic Diophantine equations: decision and construction

Contributed by Bogdan Grechuk, Ashleigh Ratcliffe

We give an algorithm that, for any polynomial with integer coefficients of degree at most two, decides whether its integer zero set is a finite union of polynomial families with integer coefficients and constructs such families whenever they exist. The main step is a constructive proof that, for every nondegenerate integral quadratic form QQ isotropic over Q\mathbb{Q} and every integer mm, the integer solutions of Q(x)=mQ(\mathbf{x})=m form a finite union of polynomial families. This proves the nondegenerate case of a result announced without proof by Vaserstein. For fixed QQ, the number of parameters in each family is bounded independently of mm. The new descent argument treats forms in at least five variables with rational Witt index one. We also settle the previously open cases zt−x2−y2=1zt-x^2-y^2=1 and zt−x2−y2=−1zt-x^2-y^2=-1 by combining Larsen--Nguyen's group parametrization with a classical reduction of binary Hermitian forms, obtaining two and three polynomial families, respectively.

Primarily AI-generated textHuman understanding: some partsarithmetic groupsintegral pointspolynomial parametrizationquadratic fieldsquadratic forms
Oct 29, 202627 pages
PDFView work

math.HO — History and Overview

10/24/2610/24/26: Factoring a Pythagorean Date

Contributed by Scott Kominers

Written numerically, the date October 24, 2026 corresponds to a Pythagorean triple---the last one of the twenty-first century! The associated 1010--2424--2626 right triangle has area twice its perimeter; a classical factorization shows that exactly three integer-sided right triangles have this property and, more generally, counts those with any prescribed integer inradius. We also observe that 6060 is the smallest perimeter shared by two noncongruent integer-sided right triangles, one of which is the 1010--2424--2626 triangle.

A mix of human-written and AI-generated textHuman understanding: all partsPythagorean datesPythagorean triplesequable trianglesrecreational mathematics
Oct 26, 20266 pages
PDFView work

math.NT — Number Theory

Local freedom and capacity barriers in quadratic trace reconstruction

Contributed by Brice Pouly

A completely multiplicative sign function is determined by its values on n2+1n^2+1, n2+2n^2+2, and n2−2n^2-2, but exact determination does not quantify how many readings detect a negative prime sign. We distinguish three losses of information: partial compatibility tests, geometric restrictions on certificates, and fractional relaxation of signed constraints. After fixing a prime head, we describe the exact fibre of a window and the parity constraints joining two windows. For any fixed head and any sequence HN=No(1)H_N=N^{o(1)}, one table with o(N)o(N) negative entries passes every HNH_N-window test and every two-reading test. A separate finite table passes these tests without any global source. We bound certificate capacity - fractional packing under unit reading loads - for narrow and binary certificates and for low-degree transport libraries whose links cancel odd prime valuations in pairs. A fixed algebraic curve of certificates for a target prime pp has at most logarithmic capacity, or capacity at most one when a reading is constant; in the infinite unanchored case its common poles have field Q(p)\mathbb{Q}(\sqrt p). Conversely, selected values of n2+1n^2+1 can force linearly many errors while the capacity of all certificates stays bounded. Two internally disjoint pair families compose without loss on their existing readings, whereas sixteen actual values exhibit Pack⁡=3<Cap⁡=4<μ=5\operatorname{Pack}=3<\operatorname{Cap}=4<\mu=5. The selected-sample constructions do not give an upper bound for the minimum on a complete prefix.

Primarily AI-generated textHuman understanding: no partsarithmetic certificatescertificate capacityforced errorsfractional packinglocal compatibilitymultiplicative reconstructionquadratic traces
Oct 20, 202641 pages
PDFView work

math.NT — Number Theory

Arithmetic reconstruction and error recovery from three quadratic traces

Contributed by Brice Pouly

We study completely multiplicative sign functions hh through their values at positive integers of the forms n2+1n^2+1, n2+2n^2+2 and n2−2n^2-2, with observed indices 1≤n≤N1\le n\le N. First occurrences of prime factors give a canonical information set and a complete, prefix-compatible family of parity relations, each involving at most ⌊log⁡2N⌋+3\lfloor\log_2N\rfloor+3 readings. These relations yield exact bounded-distance repair, including corrupted information coordinates, in time NO(1)(4+⌊log⁡2N⌋)tN^{O(1)}(4+\lfloor\log_2N\rfloor)^t for tt errors; erasures enter through an explicit rank parameter. We then construct arithmetic redundancy without estimating a quadratic regulator. If h(p)=−1h(p)=-1 and K=log⁡N/log⁡max⁡(3,p)K=\log N/\log\max(3,p), the three traces contain at least exp⁡(exp⁡(clog⁡K/log⁡log⁡K))\exp(\exp(c\log K/\log\log K)) negative readings for every fixed 0<c<log⁡20<c<\log2 and sufficiently large KK, uniformly in the prime pp and all other prime signs. The same number of each sign occurs on one trace between NαN^\alpha and NN, for each fixed α<1\alpha<1. The proof combines short reconstruction certificates, Lehmer divisibility and balanced divisors. Coprime blocks give compact access to these families without factoring large recurrence terms. Under independent reading noise with fixed erasure probability 0≤a<10\le a<1 and conditional flip probability 0≤b<1/20\le b<1/2, every source prefix P=⌊exp⁡((log⁡N)δ)⌋P=\lfloor\exp((\log N)^\delta)\rfloor, for fixed 0<δ<10<\delta<1, is recoverable from O(P)O(P) readings with polynomially small failure probability in PP and preparation polynomial in the numerical PP and log⁡N\log N. A fixed positive erasure rate nevertheless leaves exponentially many assignments of observed large-prime signs. No positive-density inverse for unrestricted sources is asserted.

Primarily AI-generated textHuman understanding: no partsarithmetic reconstructioncompletely multiplicative functionserror recoveryinformation setsparity relationsquadratic tracesreading noise
Oct 20, 202641 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