Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
12th International Symposium on Parameterized and Exact Computation, IPEC 2017, pp. 1-13, Leibniz International Proceedings in Informatics ; Volume 89
Abstract
We present two new data structures for computing values of an n-variate polynomial P of degree at most d over a finite field of q elements. Assuming that d divides q-1, our first data structure relies on (d+1)n+2 tabulated values of P to produce the value of P at any of the qn points using O(nqd2) arithmetic operations in the finite field. Assuming that s divides d and d/s divides q-1, our second data structure assumes that P satisfies a degree-separability condition and relies on (d/s + 1)n+s tabulated values to produce the value of P at any point using O(nqssq) arithmetic operations. Our data structures are based on generalizing upper-bound constructions due to Mockenhaupt and Tao (2004), Saraf and Sudan (2008), and Dvir (2009) for Kakeya sets in finite vector spaces from linear to higher-degree polynomial curves. As an application we show that the new data structures enable a faster algorithm for computing integer-valued fermionants, a family of self-reducible polynomial functions introduced by Chandrasekharan and Wiese (2011) that captures numerous fundamental algebraic and combinatorial invariants such as the determinant, the permanent, the number of Hamiltonian cycles in a directed multigraph, as well as certain partition functions of strongly correlated electron systems in statistical physics. In particular, a corollary of our main theorem for fermionants is that the permanent of an m × m integer matrix with entries bounded in absolute value by a constant can be computed in time 2m-Ω(√m/log log m), improving an earlier algorithm of Björklund (2016) that runs in time 2m-Ω(√m/logm).Description
Other note
Citation
Björklund, A, Kaski, P & Williams, R 2018, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. in 12th International Symposium on Parameterized and Exact Computation, IPEC 2017., 6, Leibniz International Proceedings in Informatics, vol. 89, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-13, International Symposium on Parameterized and Exact Computation, Vienna, Austria, 06/09/2017. https://doi.org/10.4230/LIPIcs.IPEC.2017.6