arXiv Open Access 2012

How to compute the constant term of a power of a Laurent polynomial efficiently

Pavel Metelitsyn

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SC math.AG

Penulis (1)

Pavel Metelitsyn

Format Sitasi

APA MLA BibTeX

Metelitsyn, P. (2012). How to compute the constant term of a power of a Laurent polynomial efficiently. https://arxiv.org/abs/1211.3959

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓