Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.02352

The proportion of polynomials over F_2 with positive orthogonal multiplicity

David Niedbala Giraudin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let A = F_2[T]. The orthogonal multiplicity m(f) of a monic f in A of degree d >= 1 is the number of g in A with deg g < d, gcd(g,f) = 1, and all partial quotients of g/f of degree one. Blackburn (1998) asked how the proportion p(d) of monic polynomials of degree d with m(f) > 0 behaves as d tends to infinity. We attach to each prime divisor P of f a residue psi_P(f) in F_2 of the differential dT/(T(T+1)f), and prove two unconditional facts about this family: a reciprocity relation, namely that the psi_P(f) sum to zero whenever f is prime to T(T+1), and an exact local distribution, namely that psi_P vanishes for a proportion exactly (|P|-2)/(2(|P|-1)) of the admissible completions when P exactly divides f, and for exactly half of them when P^e exactly divides f with e >= 2. Granting that these local conditions pool independently, we obtain p(d) ~ L d^(-1/2) with L = (9/(4 sqrt(pi))) times the product over the monic irreducibles P of A of degree at least two of (1 + 1/(2|P|)) (1 - 1/|P|)^(1/2), equal to 1.2116120743... The same Euler product evaluated at a second parameter returns the exact identity that the m(f) of a given degree sum to 2^d, which fixes its normalisation. We give the exact value of 2^d p(d) for 1 <= d <= 33; the predicted values agree with these to within 5 10^(-5) for 27 <= d <= 33.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Niedbala Giraudin. 2026-10-01. The proportion of polynomials over F_2 with positive orthogonal multiplicity. https://arxiv.org/abs/2610.02352

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

New Results for Euler Sums

We present a large number of analytic evaluations of Euler sums, namely sums such as \begin{align} M(m,n_0,n_1,n_2, \ldots, n_t) &= \sum_{k=1}^\infty \frac{H(k)^m}{k^{n_0} (k+1)^{n_1} (k+2)^{n_2} \cdots (k+t)^{n_t}}, \nonumber \end{align} for nonnegative integers $m$ and $(n_i)$, with $m \geq 1$ and $n_0 + n_1 + \cdots + n_t \geq 2$, where $H(k) = \sum_{j=1}^k 1/j$ is the harmonic function. These results were obtained either by algebraic manipulations, or else by very high-precision numerical evaluations combined with an integer relation algorithm to obtain the analytic formulas. We show how many of these results can be derived from a few basic facts, and that these techniques are applicable to Euler sums of even more general forms than the above cases. We then show that these results permit the calculation of constants for Euler sums resembling the Stieltjes $γ$ constants arising in the theory of the Riemann zeta function, and we also present some preliminary results on the asymptotic behavior of these constants. A sign error has been corrected in eq. 98.

math.NT↗
arXiv2026

The moments of split greatest common divisors

Sequences of the form $(\gcd(u_n,v_n))_{n \in \mathbb N}$, with $(u_n)_n$, $(v_n)_n$ sums of $S$-units, have been considered by several authors. The study of $\gcd(n,u_n)$ corresponds, after Silverman, to divisibility sequences arising from the algebraic group $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$; in this case, Sanna determined all asymptotic moments of the arithmetic function $\log\,\gcd (n,u_n)$ when $(u_n)_n$ is a Lucas sequence. Here, we characterize the asymptotic behavior of the moments themselves $\sum_{n \leq x}\,\gcd(n,u_n)^λ$, thus solving the moment problem for $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$. We give both unconditional and conditional results, the latter only relying on standard conjectures in analytic number theory.

math.NT↗