Searcharxiv⌕ Search

subject

math.NT

math.NT: explore 19 source-linked works published from 2023 to 2026, with original documents and citations.

This collection is a preview while coverage and quality are evaluated.

Search within this collection

Coverage and selection

Includes records with this source-supplied label or an explicit phrase match in their metadata. Matches indicate a mention, not proof that a paper uses a method or tests a material. Source versions are consolidated by DOI.

Sources: arxiv. Collection updated 2026-09-16. Counts describe this index, not the complete source archives.

The shifted-prime Erdős-Wintner law for primitive-root determinant densities: extremal order, dimension zero, and Fourier decay

For a prime $p$, let $c(p)=\frac{φ(p-1)}{p-1}\prod_{j\ge1}(1-p^{-j})$, the limiting density of matrices over $\mathbb F_p$ with primitive-root determinant. Its limiting law over the primes is the classical continuous shifted-totient law on $[0,1/2]$. We prove Hausdorff dimension zero and vanishing lower and upper dyadic $L^q$ dimensions for $q>1$. Its image $μ_f$ under $x\mapsto-\log x$ is Rajchman. As $T\to\infty$, for $U_T$ uniform on $[0,T]$, $\log|\widehat{μ_f}(U_T)|/\log\log T\to-1$ in probability. For every $A>0$, $|\widehat{μ_f}(τ)|\le(\log\log T)^4/\log T$ outside a subset of $[0,T]$ of relative measure $O_A((\log T)^{-A})$. As $h\downarrow0$, $\sup_aμ_f([a,a+h])=\mathfrak S_2e^{-γ}/\log(1/h)+O(\log^{-2}(1/h))$, where $\mathfrak S_2$ is the twin-prime singular series; maximizing left endpoints lie within $h$ of $\log3$ for small $h$. We prove $\min_{p\le x}c(p)\sim e^{-γ}/\log\log x$ and $\limsup_{p\to\infty}(c(p)\log\log p)^{-1}=e^γ$. The limiting law of $\log(φ(p+1)/φ(p-1))$ has support $\mathbb R$ and Hausdorff dimension zero. For the classical law of $σ(p-1)/(p-1)$ on $[3/2,\infty)$, we prove dimension zero, a sharp left-endpoint asymptotic, and a Rajchman logarithmic image. Its odd-prime component has an entire Mellin transform of order one. Partial-factorization bounds yield certified asymptotic searches for fully splitting negacyclic number-theoretic transform primes with prescribed reciprocal-density bounds at fixed power-of-two length. We determine the second distinct squared norm of $A_{n_1}\otimes\cdots\otimes A_{n_k}$ for $k,n_i\ge2$, yielding exact cyclotomic codifferent shell gaps and a uniform smoothing asymptotic at $ε=2^{-cφ(m)}$ for $c>2\log_2(1+\sqrt6)$. These results are unconditional. An explicit unproved exponent-pair hypothesis yields $|\widehat{μ_f}(τ)|=O(1/\log\log|τ|)$.

cs.CR↗

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗

DCCQ: From Ordered Bernoulli Levels to Critical-Line Geometry: Integer Quantization, Bernoulli Residual Phase, and Prime-Power Spectra

We present the discrete--complex complement quotient (DCCQ) framework through the ordered Bernoulli-word kernel $f(p,n,k)=p^k(1-p)^{n-k}$ and its inverse-integer level sets. The binary level $2^{-n}$ selects $p=1/2$ as the unique real split-independent anchor. Imposing the additional continuation rule $1-z=\overline z$ gives the conjugation-symmetric line $z=1/2+iu$. On the central normalized branch, the inverse-level split $κ=k/n$ also has real part $1/2$. The quadratic coordinate $Q(z)=1/4+u^2$ identifies complementary conjugate points, has minimum $1/4$, and has an explicit two-sign inverse; restricting its values to integers defines an arithmetic quantization. For supplied positive critical-line zero ordinates $γ_k$, the induced level has the exact decomposition \[ L_k=\frac14+γ_k^2=N_k+δ_k,\qquad δ_k=\widetilde B_1\!\left(γ_k^2+\frac34\right), \] where $N_k=\lfloor L_k+1/2\rfloor$ and $\widetilde B_1(x)=\{x\}-1/2$. The integer--phase pair $(N_k,e^{2πiδ_k})$ retains the level and the positive ordinate. Prime-exponent coordinates describe the factorization of the integer component, while conditional Fourier moments formulate an open question about the residual phases. The finite numerical diagnostics are descriptive. A distinct complex exponent $s$ gives an inverse-level representation of the supplied term $m^{-s}$; direct substitution cancels the auxiliary coordinates. These terms assemble into the classical Dirichlet series and Euler product for $\Re s>1$. The framework organizes exact coordinate identities, classical zeta connections, and numerical diagnostics; it establishes neither conditional equidistribution nor a zero-location theorem.

cs.LG↗

Supersingular Elliptic Curves Without Inseparable Small Degree Endomorphisms

For a fixed characteristic $p$, let $δ(p)$ denote the smallest degree needed to guarantee the existence of an isogeny from any supersingular curve $E$ to its Frobenius conjugate $E^{(p)}$. We translate existence questions concerning $δ(p)$ into questions about positive definite integral ternary quadratic forms and use Voronoi's theory of perfect forms in dimension three to characterize when $δ(p)$ is nearly maximal. For sufficiently large primes, we show that $δ(p)$ attains its upper bound precisely when $p$ is represented by one of nine explicit cubic polynomials, reducing the infinitude of such primes to whether one of these cubics takes prime values infinitely often. We also prove that, for almost all primes, $δ(p)$ lies at least $p^{1/6-o(1)}$ below its upper bound.

math.NT↗

The Prime Clockwork: A Dynamic Representation of Modular and Multiplicative Arithmetic

The way numbers are represented strongly influences which arithmetic structures are easy to see. The \emph{prime clockwork} is a recursively growing discrete dynamical system: a list of autonomous two-hand clocks driven by one common $+1$ signal. No primes or primality labels are supplied. Starting empty, the process appends a clock of period $n$ whenever none already present rings; the primes are generated internally as its growth times. For each installed prime $p$, the seconds reading $R_p$ advances through $0,\ldots,p-1$, and each return to zero increments the minutes reading $M_p$, which counts completed $p$-cycles. The hands use only increment, comparison, reset, and carry, without explicit \texttt{mod} or \texttt{div} operations. At time $n$, $n=pM_p(n)+R_p(n)$. The valuation readout $V_p(n)=ν_p(n)$ is generated locally: it is zero when the seconds counter is non-zero (silent state) and otherwise (when the p-clock rings) one plus the earlier valuation addressed by the current minutes reading. The valuation vector gives the integer in unique prime-factorized form. Its coordinates add and subtract under multiplication and division, representing every positive rational uniquely; divisibility becomes weak componentwise order, and unique factorization is natural in this representation. Finite seconds arrays form Cartesian-product state spaces whose common orbit visits every joint state once before repeating; this \emph{grand cycle} is the order-sensitive dynamical counterpart of the Chinese remainder theorem. The same coordinates expose gcd, lcm, perfect powers, Bézout's identity, and Euler's totient. Rational valuation levels reach certain positive algebraic irrationalities, but not algebraic numbers in general.

math.HO↗

Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization

Let $R$ be a commutative ring and $f(a_1, \ldots, a_n) = \sum_{i=1}^k r_{i1}^{a_1} \cdots r_{in}^{a_n} m_i$ be a linear-exponential map over an $R$-module $M$. Dong and Shafrir (2026) showed that, when $\ell M = 0$ for some $\ell \in \mathbb{N}_{>0}$, the zero set of $f$ is the intersection of effectively computable $p$-normal sets, where $p$ ranges over the prime divisors of $\ell$. This generalizes an earlier theorem of Derksen and Masser (2012) on the solution set of $S$-unit equations over fields of positive characteristic. The purpose of this paper is twofold. First, we give a shorter proof of Dong and Shafrir's result, using the theorem of Derksen-Masser as a blackbox. Our proof also yields a decomposition of the zero set as a positive Boolean combination of affine transformations of zero sets of linear-exponential equations over fields. Second, we prove a multi-dimensional generalization of the Skolem-Mahler-Lech theorem over rings of finite characteristic. Specifically, we show that the zero set of every $n$-dimensional linear recurrence sequence over an $R$-module $M$ satisfying $\ell M = 0$ is the intersection of effectively computable $p$-normal sets (in $\mathbb{N}^n$), where $p$ ranges over the prime divisors of $\ell$. For example, this gives a decision procedure for whether two classical linear recurrence sequences have a common value over a ring of characteristic $p^a$ or $p^a q^b$, where $p$ and $q$ are primes.

math.NT↗

Eleven, twelve, and thirteen lonely runners

Wills conjectured that, for any non-zero integers $u_1,\ldots,u_k$, there is a real number $t$ such that, for all $i=1,\ldots,k$, \[\lVert tu_i\rVert\geq\frac{1}{k+1},\] where $\lVert x\rVert$ is the distance from $x$ to the closest integer. This statement is known as the Lonely Runner Conjecture. A computational method developed by Rosenfeld and the second author verified the conjecture for $k\leq9$. We further refine this method with new sieving techniques and employ a polynomial method argument to show that any $(u_1,\ldots,u_k)\equiv(1,2,\ldots,k)\pmod{p}$ with $\gcd(u_1,\ldots,u_k)=1$ satisfies the conjecture when $k+1$ and $p > k^2+k$ are both odd primes. Ultimately, we provide a computer-assisted proof of the Lonely Runner Conjecture for $k\in\{10,11,12\}$.

math.CO↗

Logarithmic Chowla Correlations Across All Shift Scales

Let $λ(n)=(-1)^{Ω(n)}$ be the Liouville function. We prove a fixed power-logarithmic bound for its logarithmically weighted two-point correlations across the full shift range. There is an absolute $c>0$ such that every sufficiently large $x$ admits a single set $\mathcal E_x\subseteq[1,x]$ with $|\mathcal E_x\cap[1,H]|\ll_A H(\log x)^{-A}$ $(1\le H\le x)$ for every fixed $A>0$, while $\max_{\substack{1\le h\le x\ h\notin\mathcal E_x}}\sup_{1\le y\le x}\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\ll(\log x)^{1-c}$. The same exceptional-set formulation extends, without an upper cutoff, to all positive integer shifts. Earlier full-range theorems average over the shift; here a fixed saving holds pointwise outside one set whose density in every initial segment is smaller than every fixed negative power of $\log x$. The new middle-scale argument combines a general-good-modulus Liouville deletion lemma with a linear bad-modulus score, a progression Fourier estimate, and a Mellin-localized dilation that separates divisor-dependent endpoints. Maximal fixed-moment bounds evacuate the low prefix and control the long-shift range. Assuming GRH for primitive Dirichlet $L$-functions, we also prove, uniformly for $h\in\mathbb N$ and $1\le y\le x$, $\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\le\log(2\min{h,y})+O((\log x)^{1-c_{\mathrm G}})$ for an absolute $c_{\mathrm G}>0$, with no exceptional shifts.

math.NT↗

Deciding superellipticity and computing the Weierstrass normal form

Let \( \mathcal{S}_{g,n} \subset \mathcal{M}_g \) be the locus of curves of genus \( g \geq 2 \) admitting a model \( y^n = h(x) \) with \( h \) separable; such curves $C$ have a cyclic group \( C_n \leq \operatorname{Aut}(C) \) of order \( n \) with \( C/C_n \cong \mathbb{P}^1 \). % We give an algorithm which, given an absolutely irreducible plane model \( F(x,y) = 0 \) of a curve \( C \) over a field \( k_0 \) of characteristic zero, decides for which \( n \) the curve lies in \( \mathcal{S}_{g,n} \) and returns a model \( y^n = h(x) \) together with the birational transformation to it.

math.AG↗

New classes of trace-form permutation polynomials and their compositional inverses

We construct permutation polynomials of the form x + γTr^{q^2}_q(h(x)) over the finite field F_{q^2}. More precisely, we present two families ofpermutation polynomials whose coefficients range over all elements of the field rather than being restricted to a proper subfield. We also compute the compositional inverses of both families. Our techniques involve the evaluation of certain Kloosterman sums together with the analysis of some equations over finite fields, and we believe these can be of independent interest.

math.NT↗

A General Construction of Codes from Drinfeld Modules

We construct additive rank-metric and sum-rank-metric codes from Drinfeld modules by restricting bounded-degree morphisms to prime-to-characteristic torsion. For supersingular Drinfeld modules of rank $r$ in characteristic $\mathfrak{p}$ of degree $d$, the stabilization formula for morphism spaces yields rank-metric codes of $\mathbb{F}_q$-dimension $mrt-c$ and minimum distance $r-t+1$, where $c=r(r-1)(d-1)/2$. Simultaneous restriction to $\ell$ distinct degree-$m$ torsion modules gives additive sum-rank codes of the same dimension and minimum distance at least $\ell r-t+1$. Their normalized Singleton defects tend to zero, while in characteristic $(T)$ the module $ϕ_T=τ^r$ makes the defect vanish and produces an explicit MSRD family. We identify this family with a skew Chinese remainder theorem code supported on central skew polynomials and prove that its poly-skew weight is exactly $m$ times its sum-rank weight. This gives a specialized Singleton-type bound and a polynomial-time unique decoder up to the full sum-rank unique-decoding radius. We also derive a Welch-Berlekamp-type filter equation for the general supersingular sum-rank construction; it becomes an effective decoder whenever bases of the relevant morphism spaces and the restriction maps are computable.

math.NT↗

Reduced polynomial lifts of APN permutations over Galois rings and effective non-APN bounds

We study coefficientwise permutation lifts of reduced polynomial representatives of almost perfect nonlinear (APN) permutations from finite fields to Galois rings. The standard permutation criterion shows that a permutation polynomial over $\mathbb F_{2^m}$ admits such a lift if and only if its formal derivative is nowhere zero on the field. In that case, every coefficientwise lift permutes $\operatorname{GR}(2^k,m)$ for every $k>1$. It is natural to conjecture that the reduced representative of an APN permutation admits no such lift. However, Zhang and Haobo supplied a counterexample to our earlier critical-point conjecture, which also refutes this lifting claim. Their degree-$24$ reduced APN permutation over $\mathbb F_{32}$ has a nowhere-zero formal derivative. We record this example and give an exact linear-image and trace-dual criterion for the absence of rational critical points in quadratic functions. We also obtain explicit non-APN bounds from Janwa-Wilson-Rodier surfaces. For every odd degree $d\ge5$ outside the Gold and Kasami-Welch exponent families, results of Hernando-McGuire and Aubry-McGuire-Rodier yield an absolutely irreducible component defined over the ground field. Applying the Cafure-Matera point estimate gives an explicit threshold above which no polynomial of degree $d$ over $\mathbb F_{2^m}$ is APN. This makes the known qualitative nonexistence result effective. An identity between difference tables extends the bound to polynomials $ax+g(x^2)+c$, where $a\ne0$ and $g$ has an odd degree in the stated range. Finally, every cubic permutation polynomial has a rational critical point and therefore admits no coefficientwise permutation lift.

math.NT↗

Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments

We present a combinatorial proof of Simonis type MacWilliams identity for harmonic higher weight distributions of linear codes. Furthermore, we investigate the statistical moments of the harmonic higher weight enumerators for random linear codes. Defining the enumerators via rank functions of the generator matrices of linear codes, we prove that its expectation vanishes for all non-trivial harmonic functions due to the inherent symmetry of random matrices, and we also derive an explicit, non-trivial formula for the covariance.

math.CO↗

Permutation polynomials over finite fields from low-degree rational functions

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.

cs.CR↗

The second-order zero differential spectra of some functions over finite fields

It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the $F$-boomerang uniformity (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear functions is~$0$ on $\F_{p^n}$ ($p$ prime) and the one of almost perfect nonlinear functions on $\F_{2^n}$ is~$0$. It is natural to inquire what happens with APN or other low differential uniform functions in even and odd characteristics. Here, we explicitly determine the second-order zero differential spectra of several maps with low differential uniformity. In particular, we compute the second-order zero differential spectra for some almost perfect nonlinear (APN) functions over finite fields of odd characteristic, pushing further the study started in Boukerrou et al. and continued in Li et al.~[Cryptogr. Commun. 14.3 (2022), 653--662], and it turns out that our considered functions also have low second-order zero differential uniformity. Moreover, we study the second-order zero differential spectra of certain functions with low differential uniformity over finite fields of even characteristic. We connect this new concept to the sum-freedom and vanishing flats concepts and find some counts for the number of vanishing flats via our methods. We provide detailed analyses on several equations over finite fields that may have an interest outside of the scope of our paper.

cs.IT↗

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover

We revisit a classic theorem of Frougny and Sakarovitch concerning automata for $φ$-representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of existing results in the literature about these representations, in a uniform and straightforward manner. In particular, we can easily and "automatically'' recover many of the results of recent papers of Dekking and Van Loon. We also obtain a number of new results on $φ$-representations.

math.NT↗

Summing the sum of digits

We revisit and generalize inequalities for the summatory function of the sum of digits in a given integer base. We prove that several known results can be deduced from a theorem in a 2023 paper by Mohanty, Greenbury, Sarkany, Narayanan, Dingle, Ahnert, and Louis, whose primary scope is the maximum mutational robustness in genotype-phenotype maps.

math.NT↗

The second-order zero differential spectra of some APN and other maps over finite fields

The Feistel Boomerang Connectivity Table and the related notion of $F$-Boomerang uniformity (also known as the second-order zero differential uniformity) has been recently introduced by Boukerrou et al.~\cite{Bouk}. These tools shall provide a major impetus in the analysis of the security of the Feistel network-based ciphers. In the same paper, a characterization of almost perfect nonlinear functions (APN) over fields of even characteristic in terms of second-order zero differential uniformity was also given. Here, we find a sufficient condition for an odd or even function over fields of odd characteristic to be an APN function, in terms of second-order zero differential uniformity. Moreover, we compute the second-order zero differential spectra of several APN or other low differential uniform functions, and show that our considered functions also have low second-order zero differential uniformity, though it may vary widely, unlike the case for even characteristic when it is always zero.

cs.IT↗
Compare source metadata on this page
WorkPublishedSource identifierSource
The shifted-prime Erdős-Wintner law for primitive-root determinant densities: extremal order, dimension zero, and Fourier decay2026-09-242603.11196arxiv
Numerical experiments on the Hardy conjecture for the Gauss circle problem2026-09-042609.04725arxiv
DCCQ: From Ordered Bernoulli Levels to Critical-Line Geometry: Integer Quantization, Bernoulli Residual Phase, and Prime-Power Spectra2026-10-022609.03801arxiv
Supersingular Elliptic Curves Without Inseparable Small Degree Endomorphisms2026-09-032609.03839arxiv
The Prime Clockwork: A Dynamic Representation of Modular and Multiplicative Arithmetic2026-09-032609.03896arxiv
Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization2026-09-022609.03127arxiv
Eleven, twelve, and thirteen lonely runners2026-09-012604.23906arxiv
Logarithmic Chowla Correlations Across All Shift Scales2026-09-012608.23500arxiv
Deciding superellipticity and computing the Weierstrass normal form2026-09-012609.00672arxiv
New classes of trace-form permutation polynomials and their compositional inverses2026-09-012609.01350arxiv
A General Construction of Codes from Drinfeld Modules2026-09-012609.01484arxiv
Reduced polynomial lifts of APN permutations over Galois rings and effective non-APN bounds2026-10-042608.30808arxiv
Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments2026-08-212608.15864arxiv
Permutation polynomials over finite fields from low-degree rational functions2025-08-212503.20982arxiv
The second-order zero differential spectra of some functions over finite fields2025-01-272309.04219arxiv
Proving Properties of $φ$-Representations with the Walnut Theorem-Prover2024-09-062305.02672arxiv
Summing the sum of digits2024-05-082311.16806arxiv
The second-order zero differential spectra of some APN and other maps over finite fields2023-10-202310.13775arxiv

These are bibliographic comparisons, not experimental rankings. Follow the original document for methods and conditions.