2000 character limit reached
A polynomial time algorithm for calculating Fourier-Dedekind sums
Published 2 Mar 2023 in math.CO and math.NT | (2303.01185v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.