Searcharxiv⌕ Search

arXiv · 2610.24174

Recovering Dirichlet coefficients from even samples

Abstract

In this work, we determine the exact case error for recovering a Dirichlet coefficient from finitely many positive even samples with bounded additive errors. For sequences with a bounded tail and an unrestricted initial block, a polynomial estimator is minimax among all recovery maps. Its tail and noise constants admit explicit product formulas. We prove a sharp tail asymptotic on the index scale K^(3/2) and give a terminating procedure for selecting the sample count from a computable error bound.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Payam Danesh. 2026-10-16. Recovering Dirichlet coefficients from even samples. https://arxiv.org/abs/2610.24174

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

KEEP EXPLORING

Related papers

A few remarks on a Manin-Mumford conjecture in function field arithmetic and generalized Pila-Wilkie estimates

We present here the natural extension of our Pila-Wilkie type estimates on the number of rational points of the trascendent part of a compact analytic subset of $\mathbb{F}_{q}((1/T))^{n}$ to analogous subsets of $K^{n}$, where $K$ is a general local field of any characteristic. That would integrate the analogous estimate provided by F. Loeser, G. Comte and R. Cluckers in characteristic 0.

math.NT↗

No new Goormaghtigh primes up to $10^{700}$

The Goormaghtigh conjecture states that the only two numbers which have two non-trivial representations as repunits are $31$ and $8191$. We call such a prime number a {\it Goormaghtigh prime}. We show that there are no other Goormaghtigh primes less than $10^{700}$.

math.NT↗