The bounded-distance characterization of mock characters

Let \a0U\a0\mathbb U denote the complex unit disc, and let \a0D(f,g;y)\a0\mathbb D(f,g;y) be the pseudometric on completely multiplicative functions defined by

D(f,g;y):=(py1Ref(p)g(p)p)1/2.\mathbb D(f,g;y):= \left(\sum_{p \leq y} \frac{1-\operatorname{Re} f(p) \overline{g(p)}}{p}\right)^{1/2}.

A mock character is a completely multiplicative function whose sequence is automatic but not eventually periodic and which vanishes precisely at zero and at integers sharing a common factor with a fixed integer. A Dirichlet character is understood in the usual sense.

Bounded-distance conjecture. For any mock character κ\kappa, there exists a Dirichlet character χ\chi such that D(κ,χ;y)\mathbb D(\kappa,\chi;y) is bounded. Conversely, if κ:ZU\kappa: \mathbb Z \to \mathbb U is completely multiplicative and at a bounded distance from some Dirichlet character, then κ\kappa must be a mock character.

The proposition immediately preceding this conjecture proves the first assertion for the family κa\kappa_a considered in the paper. The conjecture proposes the corresponding statement for all mock characters and a converse characterization; the source gives no resolution status.

Sources & referencesView supporting material

Primary source

Jean-Paul Allouche and Leo Goldmakher, “Mock characters and the Kronecker symbol”, arXiv:1608.03957 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.