Fast Computation of Generalized Dedekind Sums

DOI10.1142/S179304212450060XarXiv2210.01172OpenAlexW4392782123MaRDI QIDQ6412784FDOQ6412784

Authors: Preston Tranbarger, Jessica Wang 

Publication date: 3 October 2022

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.

Full work available at URL: https://doi.org/10.1142/s179304212450060x

Recommendations

• scientific article; zbMATH DE number 2156407
• Dedekind cotangent sums
• scientific article; zbMATH DE number 94971
• Evaluation of Dedekind sums, Eisenstein cocycles, and special values of \(L\)-functions
• On generalized Dedekind sums

Mathematics Subject Classification ID

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

This page was built for publication: Fast Computation of Generalized Dedekind Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412784)