Fast computation of generalized dedekind sums

IF 0.5 3区数学 Q3 MATHEMATICS

International Journal of Number Theory Pub Date : 2024-03-20 DOI:10.1142/s179304212450060x

Preston Tranbarger, Jessica Wang

引用次数: 0

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.

查看原文本刊更多论文

广义推演和的快速计算

我们构建了一种算法，将计算广义戴德金和的复杂度从指数时间降低到多项式时间。为此，我们使用了群论中的高效词重写过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Number Theory 数学-数学

CiteScore

1.10

自引率

14.30%

发文量

审稿时长

4-8 weeks

期刊介绍： This journal publishes original research papers and review articles on all areas of Number Theory, including elementary number theory, analytic number theory, algebraic number theory, arithmetic algebraic geometry, geometry of numbers, diophantine equations, diophantine approximation, transcendental number theory, probabilistic number theory, modular forms, multiplicative number theory, additive number theory, partitions, and computational number theory.