Mock characters and the Kronecker symbol

DOI10.1016/j.jnt.2018.04.022zbMath1448.11062arXiv1608.03957OpenAlexW2963630409MaRDI QIDQ1786705

Leo Goldmakher, Jean-Paul Allouche

Publication date: 24 September 2018

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.03957

zbMATH Keywords

automatic sequencesDirichlet characterspretentiousnesscomplete multiplicative functionsKronecker symbols

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Automata sequences (11B85) Formal power series rings (13F25)

Related Items (13)

How to prove that a sequence is not automatic ⋮ Une note sur la densité des zéros des sommes partielles de la fonction zeta de Dedekind sur un corps quadratique ⋮ On completely multiplicative automatic sequences ⋮ Arithmetic density and new congruences for \(3\)-core partitions ⋮ Arithmetic density and congruences of \(t\)-core partitions ⋮ On multiplicative automatic sequences ⋮ A note on multiplicative automatic sequences, II ⋮ Number of zero-modes on magnetized \(T^4/Z_N\) orbifolds analyzed by modular transformation ⋮ New density results and congruences for Andrews' singular overpartitions ⋮ Automatic sequences are orthogonal to aperiodic multiplicative functions ⋮ On mex-related partition functions of Andrews and Newman ⋮ Multiplicative automatic sequences ⋮ A note on multiplicative automatic sequences

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
• Paperfolding infinite products and the gamma function
• (Non)Automaticity of number theoretic functions
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Multiplicative and additive recurrent sequences
• Computing the cycles in the perfect shuffle permutation
• Multiplicative functions and \(k\)-automatic sequences
• Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
• Jacobi symbols and Eulers number \(e\)
• PERIODIC CONTINUED FRACTIONS AND JACOBI SYMBOLS
• On Multiplicative Functions with Bounded Partial Sums
• THE MINIMAL GROWTH OF A -REGULAR SEQUENCE
• Completely multiplicative functions taking values in ${-1,1}$
• Completely Multiplicative Automatic Functions
• Transcendence of generating functions whose coefficients are multiplicative
• CONTINUED FRACTIONS AND JACOBI SYMBOLS
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• Transcendence of power series for some number theoretic functions
• Potenzreihen mit multiplikativen Koeffizienten
• Suites algébriques, automates et substitutions
• Automatic Sequences
• Quadratic Irrationals
• On the base-dependence of sets of numbers recognizable by finite automata
• Sur les fonctions arithmétiques multiplicatives
• The Calculation of Certain Dirichlet Series

This page was built for publication: Mock characters and the Kronecker symbol