Related papers: CHAPLIN - Complex Harmonic Polylogarithms in Fortr…
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that consists of 2-input AND gates, 2-input XOR gates, and…
It's well known that multiple polylogarithms give rise to good unipotent variations of mixed Hodge-Tate structures. In this paper we shall {\em explicitly} determine these structures related to multiple logarithms and some other multiple…
Extending Eulerian polynomials and Faulhaber's formula 1, we study several combi-natorial aspects of harmonic sums and polylogarithms at non-positive multi-indices as well as their structure. Our techniques are based on the combinatorics of…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
This paper reports on a simple pure numerical method developed for computing Hansen coefficients by using recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for…
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…
We introduce hankl, a lightweight Python implementation of the FFTLog algorithm for Cosmology. The FFTLog algorithm is an extension of the Fast Fourier Transform (FFT) for logarithmically spaced periodic sequences. It can be used to…
We present a MATLAB package called the Pha-sorArray Toolbox that has been developed to make harmonic analysis and control methods both practical and user-friendly. The toolbox adopts an object-oriented architecture that enables intuitive…
Extraction of harmonics of a given order from real trigonometric polynomials (signals) is one of the main problems in harmonic analysis. It has many applications in physics, radio and electrical engineering, in particular, in filtration of…
We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
In this paper, we consider three families of numerical series with general terms containing the harmonic numbers, and we use simple methods from classical and complex analysis to find explicit formulas for their respective sums.
Series representations consisting of spherical harmonics are obtained for characteristic exponents and probability density functions of multivariate stable distributions under various conditions. A esult potentially applicable in a…
We evaluate a four-loop conformal integral, i.e. an integral over four four-dimensional coordinates, by turning to its dimensionally regularized version and applying differential equations for the set of the corresponding 213 master…
For many physical quantities, theory supplies weak- and strong-coupling expansions of the types $\sum a_n \alpha ^n$ and $ \alpha ^p\sum b_n (\alpha^{-2/q) ^n$, respectively. Either or both of these may have a zero radius of convergence. We…
We present a method to obtain analytic results in terms of multiple polylogarithms for one-loop triangle, box and pentagon integrals depending on an arbitrary number of scales and to any desired order in the Laurent expansion in the…
A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…
We present new functional equations in weights 5, 6 and 7 and use them for explicit depth reduction of multiple polylogarithms. These identities generalize the crucial identity $\mathbf{Q}_4$ from the recent work of Goncharov and Rudenko…
We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…
This paper is a second part of our study of the Discrete Polyharmonic Cubature Formulas on the disc. It completes our study and provides a satisfactory cubature formula in terms of precision and number of evaluation points (coefficient of…