Abstract: We introduce and study a family of functions we call the "mock characters". These functions satisfy a number of interesting properties, and of all completely multiplicative arithmetic functions seem to come as close as possible to being Dirichlet characters. Along the way we prove a few new results concerning the behavior of the Kronecker symbol.
Recommendations
Cites work
- scientific article; zbMATH DE number 2186859 (Why is no real title available?)
- scientific article; zbMATH DE number 1001512 (Why is no real title available?)
- scientific article; zbMATH DE number 3129504 (Why is no real title available?)
- scientific article; zbMATH DE number 3874638 (Why is no real title available?)
- scientific article; zbMATH DE number 3754775 (Why is no real title available?)
- scientific article; zbMATH DE number 1092357 (Why is no real title available?)
- scientific article; zbMATH DE number 3331635 (Why is no real title available?)
- scientific article; zbMATH DE number 3057982 (Why is no real title available?)
- scientific article; zbMATH DE number 3058949 (Why is no real title available?)
- scientific article; zbMATH DE number 3082668 (Why is no real title available?)
- (Non)Automaticity of number theoretic functions
- Automatic Sequences
- CONTINUED FRACTIONS AND JACOBI SYMBOLS
- Completely multiplicative automatic functions
- Completely multiplicative functions taking values in ${-1,1}$
- Computing the cycles in the perfect shuffle permutation
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Jacobi symbols and Eulers number \(e\)
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- Multiplicative and additive recurrent sequences
- Multiplicative functions and \(k\)-automatic sequences
- Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
- On multiplicative functions with bounded partial sums
- On the base-dependence of sets of numbers recognizable by finite automata
- Paperfolding infinite products and the gamma function
- Periodic continued fractions and Jacobi symbols
- Potenzreihen mit multiplikativen Koeffizienten
- Quadratic irrationals. An introduction to classical number theory
- Suites algébriques, automates et substitutions
- Sur les fonctions arithmétiques multiplicatives
- The Calculation of Certain Dirichlet Series
- The minimal growth of a \(k\)-regular sequence
- Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
- Transcendence of generating functions whose coefficients are multiplicative
- Transcendence of power series for some number theoretic functions
Cited in
(12)- A note on multiplicative automatic sequences. II
- Multiplicative automatic sequences
- On completely multiplicative automatic sequences
- How to prove that a sequence is not automatic
- A note on multiplicative automatic sequences
- A note on the density of zeros of partial sums of the Dedekind zeta function over a quadratic field
- New density results and congruences for Andrews' singular overpartitions
- On asymptotically automatic sequences
- Arithmetic density and new congruences for \(3\)-core partitions
- Arithmetic density and congruences of \(t\)-core partitions
- On multiplicative automatic sequences
- Number of zero-modes on magnetized \(T^4/Z_N\) orbifolds analyzed by modular transformation
This page was built for publication: Mock characters and the Kronecker symbol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786705)
