How to compute the constant term of a power of a Laurent polynomial efficiently
Metelitsyn, Pavel
Original · EN
We present an algorithm for efficient computation of the constant term of a power of a multivariate Laurent polynomial. The algorithm is based on univariate interpolation, does not require the storage of intermediate data and can be easily parallelized. As an application we compute the power series expansion of the principal period of some toric Calabi-Yau varieties and find previously unknown differential operators of Calabi-Yau type.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.