相关论文: Numerical Evaluation of Harmonic Polylogarithms

We show that when integral polytopes are deformed while keeping the same facet normal vectors, the coefficients of weighted Ehrhart and $h^*$-polynomials are piecewise polynomial functions in the ``right hand sides'' of the linear…

In this paper, we describe a numerical continuation method that enables harmonic analysis of nonlinear periodic oscillators. This method is formulated as a boundary value problem that can be readily implemented by resorting to a standard…

We present here a large collection of harmonic and quadratic harmonic sums, that can be useful in applied questions, e.g., probabilistic ones. We find closed-form formulae, that we were not able to locate in the literature.

In this article it is shown that the study of harmonic diffeomorphisms, with nonvanishing Hopf differential, reduces to the study of the Beltrami equation of a certain type: the imaginary part of the logarithm of the Beltrami function…

We propose a novel quantum algorithm for solving nuclear resonances, which is based on the iterative Harrow-Hassidim-Lloyd algorithm and eigenvector continuation with complex scaling. To validate this approach, we compute the resonant…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

In the study of alternative or extended theories of gravity, Dirac's Hamiltonian constraint algorithm is invaluable for enumerating the propagating modes and gauge symmetries. For gravity, this canonical approach is frequently applied as a…

\medskip\noindent\textbf{R\'esum\'e.} Soit $l$ un entier et $\ors=(s_1, \dots, s_l)$ une s\'equence d'entiers positifs. Dans ce document, nous \'etudierons les propri\'et\'es arithm\'etique de sommes harmoniques multiples $H(\ors; n)$, qui…

Solutions to Laplace's equation are called harmonic functions. Harmonic functions arise in many applications, such as physics and the theory of stochastic processes. Of interest classically are harmonic polynomials, which have a simple…

We derive out a complete series expression of Hamiltonian eigenvalues without any approximation and cut in the general quantum systems based on Wang's formal framework \cite{wang1}. In particular, we then propose a calculating approach of…

This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

A new characterization of harmonic functions is obtained. It is based on quadrature identities involving mean values over annular domains and over concentric spheres lying within these domains or on their boundaries. The analogous result…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…

We prove the reality of the perturbed eigenvalues of some PT symmetric Hamiltonians of physical interest by means of stability methods. In particular we study 2-dimensional generalized harmonic oscillators with polynomial perturbation and…

This paper presents the evaluation of the Euler sums of generalized hyperharmonic numbers $H_{n}^{\left( p,q\right) }$ \[ \zeta_{H^{\left( p,q\right) }}\left( r\right) =\sum\limits_{n=1}^{\infty }\dfrac{H_{n}^{\left( p,q\right) }}{n^{r}}%…

Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…

We express a general multiple polylogarithm of weight n as an explicit linear combination of multiple polylogarithms of weight n in n-2 variables. We express a general multiple polylogarithm of weight 4 as an explicit linear combination of…

Light sources based on high-harmonic generation (HHG) underpin ultrafast spectroscopy experiments across a large range of photon energies, spanning from the extreme-ultraviolet to the soft x-ray. To this day their design, implementation and…