A polynomial time algorithm for calculating Fourier-Dedekind sums
Combinatorics
2023-03-03 v1 Number Theory
Abstract
We solve an open problem proposed in the book ``Computing the continuous discretely" written by Matthias Beck and Sinai Robins. That is, we proposed a polynomial time algorithm for calculating Fourier-Dedekind sums. The algorithm is simple modular Barvinok's simplicial cone decomposition. It can be easily adapted into De Leora et. al.'s LattE package, which gives a nice implimentation of Barvinok's polynomial time algorithm.
Cite
@article{arxiv.2303.01185,
title = {A polynomial time algorithm for calculating Fourier-Dedekind sums},
author = {Guoce Xin and Xinyu Xu},
journal= {arXiv preprint arXiv:2303.01185},
year = {2023}
}
Comments
4 pages