A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums

DOI10.1080/10586458.2024.2364264MaRDI QIDQ6925286zbMATH OpenFDO

Authors Guoce Xin, Xinyu Xu

Publication date 26 September 2025

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10586458.2024.2364264

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Dedekind eta function, Dedekind sums (11F20) Gauss and Kloosterman sums; generalizations (11L05) Number-theoretic algorithms; complexity (11Y16)

Cites work

• A Euclid style algorithm for MacMahon's partition analysis
• A fast algorithm for MacMahon's partition analysis
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• Computing the Continuous Discretely
• Dedekind cotangent sums
• Effective lattice point counting in rational convex polytopes
• Evaluation of Dedekind sums, Eisenstein cocycles, and special values of \(L\)-functions
• Higher dimensional Dedekind sums
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 2156407 (Why is no real title available?)
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• scientific article; zbMATH DE number 3396015 (Why is no real title available?)
• The Ehrhart polynomial of a lattice polytope

This page was built for publication: A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums

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