Pure Math · Mathematics & Statistics
Number Theory
The newest papers in Number Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
58 papers, from 1 September 2026 to 3 November 2026: 40 OpenAlex records and 18 arXiv preprints.
Get the few papers worth your time in Number Theory every morning.
Follow Number Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 3
More (shifted) runners, less loneliness
The shifted lonely runner conjecture was recently disproved by Blanco, Criado and Santos.A two-step supercongruence for an Apéry-like sequence
Let $G_n=\sum_{k=0}^n4^k\binom{2n-2k}{n-k}^{2}\binom{2k}{k}$.Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
It is well known that the set of Mahler measures of single variable polynomial has limit points of which a list established by D. Boyd and M. Mossinghoff has been extended through approaches based…Kernel--wreath constructions and infinite families of finite simple skew braces
We introduce a kernel--wreath construction for finite skew braces.List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$
We give new bounds for list sizes of random linear codes at capacity, max loads of linear hash functions, and Furstenberg sets, over every finite field $\mathbb{F}_q$.Generalized DCCQ: From Binary Quotients to Multinomial Simplex Geometry and Critical-Strip Coordinates
We extend the discrete complex complement quotient (DCCQ) framework from binary Bernoulli counts to multinomial count compositions.Two Extremal Even Unimodular Lattices of Rank $88$
In this paper, we construct two extremal positive definite even unimodular lattices of rank $88$ using a Hermitian tensor product over $\mathbb{Q}(\sqrt{-23})$, thereby extending the known existence…Relative commuting probability and BFC-type results for finite skew braces
We develop a probabilistic approach to the structure of finite skew left braces, motivated both by classical commuting probability in finite group theory and by the role of skew left braces in the…Internal congruences modulo powers of 2 for $k$-colored overpartitions into odd parts
Let $\overline{po}_k(n)$ denote the number of $k$-colored overpartitions of $n$ into odd parts.Integer group determinants for abelian groups of order 24
We determine the integer group determinant sets for $C_{24}$, $C_2\times C_{12}$ and $C_2^2\times C_6$, the three abelian groups of order $24$.Integer group determinants for the elementary abelian group of order 49
Let $G=C_7\times C_7$, and let $S(G)$ denote the set of integer values of its group determinant.Construction of Finite Hilbert--Pólya Matrices from Weil's Explicit Formula
Starting from the Riemann--$Ξ$ specialization of Weil's explicit formula, we construct finite real-symmetric Prime--Weil matrices $(\mathbf S)$ from pole, archimedean, and finite prime-power data.Catalan's constant is irrational
Whether the constant $$G=\sum_{k=0}^\infty\frac{(-1)^k}{(2k+1)^2}=\frac1{1^2}-\frac1{3^2}+\frac1{5^2}-\frac1{7^2}+\cdots$$ introduced by Catalan in the nineteen century is irrational, is a…Odd denominators in the Lonely Runner spectrum for six speeds
For distinct positive integers v_1, ..., v_n let ML(v_1, ..., v_n) be the largest number L such that at some time t every t vi is at distance at least L from the nearest integer; the Lonely Runner…Petersson-Rigid Lattices in a Census of 100 Rank-Three Root Bases
The first paper worked out one family of four lattices in full — |det| = 12, 24, 36and 72.A new proof that more than $2/3$ of the zeros of the Riemann zeta function are simple and on the critical line
We obtain a new, conceptually simpler, unconditional proof that more than $67.25\%$ of the non-trivial zeros of the Riemann zeta function are simple and on the critical line, and that at least…Fourteen and fifteen lonely runners
We prove the Lonely Runner Conjecture for fourteen and fifteen runners.Points of maximal traffic on a grid with obstruction
For $n\in\mathbb{N}$, we consider the set of lattice paths from $(0,0)$ to $(n,n)$ using only unit north and east steps.