Source
The X account @PQBW posts new arXiv papers in number theory.
The account focuses on prime numbers and diophantine equations.
This issue records subject matter that may have synergy with prime-gap-structure (PGS) research.
PGS studies deterministic interiors and boundaries of prime gaps.
It uses the Divisor Normalization Identity, Gap Winner Rule, Z-invariants, geodesic prefilters, and boundary certificates.
Synergy 1: Primes in short intervals and gap structure
PGS examines the deterministic structure of gaps between consecutive primes.
Related X post and paper
The paper reviews the 2024 zero-density theorem of Guth and Maynard.
The theorem improves bounds on zeros of the zeta function with real part greater than 1/2.
The improved bounds give better control on the number of primes in short intervals.
Better interval bounds limit possible gap sizes.
PGS deterministic certificates can test the new interval bounds.
PGS geometric prefilters can supply explicit witnesses inside the intervals.
Additional related post
The paper proves almost-sure bounds on the largest empty circular gap in orbits of lacunary sequences.
The normalized gap size stays between 1/2 and a constant that depends on the growth rate.
PGS models of gap interiors can map these maximal gaps onto the integer line.
The mapping may produce new deterministic constraints on consecutive composite runs.
Synergy 2: Twin primes, Goldbach partitions, and bounded gaps
PGS examines the structure of small gaps, including gaps of size 2.
Related X post and paper
The paper defines statement (S): every even n ≥ 6 equals p + t where p is prime and t is a twin member.
Statement (S) implies both the Goldbach conjecture and the twin-prime conjecture.
The paper proves an orientation-rigidity theorem.
For n not divisible by 3, all twin members that appear in Goldbach partitions of n share the same orientation.
The paper verifies (S) for all even n up to 10^12.
The least twin witness stays below (log n)^3.
PGS boundary-certificate methods can certify the orientation of twin members inside a given gap.
The Rule X engine can search for deterministic patterns that force the orientation rigidity.
The Z-invariant can rank the twin witnesses and test the observed density against the Hardy–Littlewood constant.
Additional related posts on Goldbach and gaps
Synergy 3: Algebraic recovery of the next prime
PGS seeks deterministic certificates that locate primes without probabilistic tests.
Related X post and paper
The paper builds a polynomial quotient ring from a single modular exponentiation.
The nonzero monomial degrees of the remainder are exactly the primes in the interval (n, 2n].
When n equals a prime p_k, the least nonzero degree equals the next prime p_{k+1}.
No prime table, no index, and no primality test is required.
This algebraic construction supplies an independent certificate for the successor prime.
PGS geodesic prefilters can restrict the possible degrees before the modular exponentiation.
PGS boundary solvers can verify that the recovered degree lies outside all composite attractors.
The two methods together give a hybrid deterministic recovery path.
Synergy 4: Exact combinatorial counts of primes in fixed intervals
PGS prefers exact, non-asymptotic descriptions of gap structure.
Related X post and paper
The paper defines intervals I_k = [(2k-1)^2, (2k+1)^2).
It gives the exact identity P_k = N_k - S_k + E_k.
N_k counts the odd integers in the interval.
S_k and E_k are matrix multiplicities of odd composites.
All three quantities come from divisor data alone.
No primality test is used.
The identity converts the existence of at least one prime in every I_k into a pure combinatorial inequality.
PGS matrix or geometric representations of gap interiors can supply the multiplicity counts S_k and E_k.
The Z-invariant can weight the odd integers inside each I_k.
The combination yields an independent verification of the combinatorial inequality for large k.
Additional related posts
These results describe the composite runs that form the interiors of gaps.
PGS deterministic models of gap interiors can absorb the density statements and produce sharper certificates.
Proposed next steps
- Review the arXiv papers listed above.
- Test the orientation-rigidity theorem against PGS boundary certificates for small twin gaps.
- Implement a prototype that combines the Prime-Interval Algebra construction with a PGS geodesic prefilter.
- Check whether the matrix multiplicity formula reproduces known PGS first-arrival laws inside intervals between odd squares.
- Record any new deterministic constraints that arise from the short-interval zero-density bounds.
References
All X posts come from the account https://x.com/PQBW.
All papers are public on arXiv under the math.NT category.
Source
The X account @PQBW posts new arXiv papers in number theory.
The account focuses on prime numbers and diophantine equations.
This issue records subject matter that may have synergy with prime-gap-structure (PGS) research.
PGS studies deterministic interiors and boundaries of prime gaps.
It uses the Divisor Normalization Identity, Gap Winner Rule, Z-invariants, geodesic prefilters, and boundary certificates.
Synergy 1: Primes in short intervals and gap structure
PGS examines the deterministic structure of gaps between consecutive primes.
Related X post and paper
Paper: A decades-long breakthrough in zero-density estimates and primes in short intervals
Author: Caroline L. Turnage-Butterbaugh
arXiv: https://arxiv.org/abs/2607.04632
The paper reviews the 2024 zero-density theorem of Guth and Maynard.
The theorem improves bounds on zeros of the zeta function with real part greater than 1/2.
The improved bounds give better control on the number of primes in short intervals.
Better interval bounds limit possible gap sizes.
PGS deterministic certificates can test the new interval bounds.
PGS geometric prefilters can supply explicit witnesses inside the intervals.
Additional related post
Paper: Maximal Gaps for Dilated Lacunary Integer Sequences
Authors: Yuval Peres, Bohan Yang
arXiv: https://arxiv.org/abs/2606.28860
The paper proves almost-sure bounds on the largest empty circular gap in orbits of lacunary sequences.
The normalized gap size stays between 1/2 and a constant that depends on the growth rate.
PGS models of gap interiors can map these maximal gaps onto the integer line.
The mapping may produce new deterministic constraints on consecutive composite runs.
Synergy 2: Twin primes, Goldbach partitions, and bounded gaps
PGS examines the structure of small gaps, including gaps of size 2.
Related X post and paper
Paper: An intermediate conjecture between Goldbach and Dubner: every even number is the sum of a prime and a twin prime
Author: Tushar Pandey
arXiv: https://arxiv.org/abs/2608.02381
The paper defines statement (S): every even n ≥ 6 equals p + t where p is prime and t is a twin member.
Statement (S) implies both the Goldbach conjecture and the twin-prime conjecture.
The paper proves an orientation-rigidity theorem.
For n not divisible by 3, all twin members that appear in Goldbach partitions of n share the same orientation.
The paper verifies (S) for all even n up to 10^12.
The least twin witness stays below (log n)^3.
PGS boundary-certificate methods can certify the orientation of twin members inside a given gap.
The Rule X engine can search for deterministic patterns that force the orientation rigidity.
The Z-invariant can rank the twin witnesses and test the observed density against the Hardy–Littlewood constant.
Additional related posts on Goldbach and gaps
X post: https://x.com/PQBW/status/2083111835159384477
Paper: The exceptional set of the Goldbach problem
arXiv: https://arxiv.org/abs/2607.27282
X post: https://x.com/PQBW/status/2071998834775843049
Paper: On the level of distribution of Goldbach primes and its applications
arXiv: https://arxiv.org/abs/2606.29559
X post: https://x.com/PQBW/status/2063224441136394436
Paper: Theorem (1+1.9) on the Goldbach Conjecture
arXiv: https://arxiv.org/abs/2606.05224
X post: https://x.com/PQBW/status/2058152038077210767
Paper: The reverse Goldbach problem and a refined Zsiflaw–Legeis theorem
arXiv: https://arxiv.org/abs/2605.21876
Synergy 3: Algebraic recovery of the next prime
PGS seeks deterministic certificates that locate primes without probabilistic tests.
Related X post and paper
Paper: Prime-Interval Algebras
Author: Joseph M. Shunia
arXiv: https://arxiv.org/abs/2607.22347
The paper builds a polynomial quotient ring from a single modular exponentiation.
The nonzero monomial degrees of the remainder are exactly the primes in the interval (n, 2n].
When n equals a prime p_k, the least nonzero degree equals the next prime p_{k+1}.
No prime table, no index, and no primality test is required.
This algebraic construction supplies an independent certificate for the successor prime.
PGS geodesic prefilters can restrict the possible degrees before the modular exponentiation.
PGS boundary solvers can verify that the recovered degree lies outside all composite attractors.
The two methods together give a hybrid deterministic recovery path.
Synergy 4: Exact combinatorial counts of primes in fixed intervals
PGS prefers exact, non-asymptotic descriptions of gap structure.
Related X post and paper
Paper: A Matrix-Theoretic Exact Formula for Counting Primes in Intervals Between Consecutive Odd Squares
Author: Wujie Shi
arXiv: https://arxiv.org/abs/2605.21529
The paper defines intervals I_k = [(2k-1)^2, (2k+1)^2).
It gives the exact identity P_k = N_k - S_k + E_k.
N_k counts the odd integers in the interval.
S_k and E_k are matrix multiplicities of odd composites.
All three quantities come from divisor data alone.
No primality test is used.
The identity converts the existence of at least one prime in every I_k into a pure combinatorial inequality.
PGS matrix or geometric representations of gap interiors can supply the multiplicity counts S_k and E_k.
The Z-invariant can weight the odd integers inside each I_k.
The combination yields an independent verification of the combinatorial inequality for large k.
Additional related posts
X post: https://x.com/PQBW/status/2079342878271160800
Paper: An improvement on the largest prime factors of consecutive integers
arXiv: https://arxiv.org/abs/2607.16032
X post: https://x.com/PQBW/status/2068056980019658984
Paper: Consecutive integers free of certain prime factors
arXiv: https://arxiv.org/abs/2606.19863
These results describe the composite runs that form the interiors of gaps.
PGS deterministic models of gap interiors can absorb the density statements and produce sharper certificates.
Proposed next steps
References
All X posts come from the account https://x.com/PQBW.
All papers are public on arXiv under the math.NT category.