Pith. sign in

REVIEW

Fast Computation of Generalized Dedekind Sums

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.01172 v1 pith:2ODQRDU5 submitted 2022-10-03 math.NT

Preston Tranbarger , Jessica Wang This is my paper · ORCID
classification math.NT
keywords dedekindgeneralizedsumsalgorithmcomplexitycomputationcomputingconstruct
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools