Fast Computation of Generalized Dedekind Sums
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2022
- DOI:
- 10.48550/arXiv.2210.01172
- arXiv:
- arXiv:2210.01172
- Bibcode:
- 2022arXiv221001172T
- Keywords:
-
- Mathematics - Number Theory;
- 11F20
- E-Print:
- 11 pages, 1 figure