×

Fast computation of generalized Dedekind sums. (English) Zbl 07864366

Summary: We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.

MSC:

11F20 Dedekind eta function, Dedekind sums
11F03 Modular and automorphic functions
11F67 Special values of automorphic \(L\)-series, periods of automorphic forms, cohomology, modular symbols

References:

[1] Beck, M. and Robins, S., Computing the Continuous Discretely, 2nd edition, , Vol. 154 (Springer-Verlag, 2015). · Zbl 1339.52002
[2] Dillon, T. and Gaston, S., An average of generalized Dedekind sums, J. Number Theory212 (2020) 323-338. · Zbl 1445.11028
[3] Iwaniec, H., Topics in Classical Automorphic Forms, , Vol. 17 (American Mathematical Society, 1997). · Zbl 0905.11023
[4] Knuth, D. E., The Art of Computer Programming, Vol. 2, (Addison-Wesley Longman Publishing Co., Inc., USA, 1997). · Zbl 0883.68015
[5] LaBelle, A., Van Bergeyk, E. and Young, M. P., Reciprocity and the kernel of Dedekind sums, Res. Number Theory9 (2023) 80. · Zbl 07771758
[6] Majure, M., Algebraic properties of the values of newform Dedekind sums, J. Number Theory250 (2023) 35-48. · Zbl 1533.11081
[7] Magnus, W., Karrass, A. and Solitar, D., Combinatorial Group Theory, 2nd edition (Dover Publications, 2004). · Zbl 1130.20307
[8] Nguyen, E., Ramirez, J. J. and Young, M. P., The kernel of newform Dedekind sums, J. Number Theory223 (2021) 53-63. · Zbl 1469.11074
[9] Rademacher, H. and Grosswald, E., Dedekind Sums, , No. 16 (Mathematical Association of America, 1972). · Zbl 0251.10020
[10] Stein, W., Modular Forms, a Computational Approach, , Vol. 79 (American Mathematical Society, 2007). · Zbl 1110.11015
[11] Stucker, T., Vennos, A. and Young, M. P., Dedekind sums arising from newform Eisenstein series, Int. J. Number Theory16(10) (2020) 2129-2139. · Zbl 1456.11062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.