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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.