The bounded-distance characterization of mock characters
The bounded-distance characterization of mock characters
Let denote the complex unit disc, and let be the pseudometric on completely multiplicative functions defined by
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 , there exists a Dirichlet character such that is bounded. Conversely, if is completely multiplicative and at a bounded distance from some Dirichlet character, then must be a mock character.
The proposition immediately preceding this conjecture proves the first assertion for the family 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.