Fast Computation of Generalized Dedekind Sums
Number Theory
2022-10-05 v1
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.
Cite
@article{arxiv.2210.01172,
title = {Fast Computation of Generalized Dedekind Sums},
author = {Preston Tranbarger and Jessica Wang},
journal= {arXiv preprint arXiv:2210.01172},
year = {2022}
}
Comments
11 pages, 1 figure