Related papers: On multi-variable Zassenhaus formula

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

We study an elliptic analogue of multiple zeta values, the elliptic multiple zeta values of Enriquez, which are the coefficients of the elliptic KZB associator. Originally defined by iterated integrals on a once-punctured complex elliptic…

Flajolet and Salvy pointed out that every Euler sum is a $\mathbb{Q}$-linear combination of multiple zeta values. However, in the literature, there is no formula completely revealing this relation. In this paper, using permutations and…

Using Bayes's theorem, we derive a unit-wise recurrence as well as a backward recursion similar to the forward-backward algorithm. The resulting Bayesian recurrent units can be integrated as recurrent neural networks within deep learning…

We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…

In this paper, we study the weighted estimates for multilinear Calder\'{o}n-Zygmund operators %with multiple $A_{\vec{P}}$ weights from $L^{p_1}(w_1)\times...\times L^{p_m}(w_m)$ to $L^{p}(v_{\vec{w}})$, where $1<p, p_1,...,p_m<\infty$ with…

The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…

A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…

Let $X_1,\,X_2,\,\ldots,\,X_N$, $N\in\mathbb{N}$ be independent but not necessarily identically distributed discrete and integer-valued random variables. Assume that $X_1\geqslant m_1$, $X_2\geqslant m_2$, $\ldots$, $X_N\geqslant m_N$…

This paper investigates a recursive formulation of auto-regressive multi-fidelity Gaussian process regression in the challenging setting of noisy and non-nested high- and low-fidelity data. We propose a decoupled optimization strategy based…

In this paper, we are going to perform the shuffle products of $Z_-(n) = \sum_{a+b=m} (-1)^{b} \zeta(\{1\}^{a},b+2)$ and $Z_+^\star(n) = \sum_{c+d=n} \zeta^{\star}(\{1\}^{c},d+2)$ with $m+n = p$. The resulted shuffle relation is a weighted…

Using the representation of E_q(2) on the non-commutative space zz^*-qz^*z=\sigma; q<1, \sigma>0 summation formulas for the product of two, three and four q-Kummer functions are derived.

Using recurrences gotten from the Apagodu-Zeilberger Multivariate Almkvist-Zeilberger algorithm we present a linear-time, and constant-space, algorithm to compute the general mixed moments of the k-variate general normal distribution, with…

We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.

In this paper, we employ contour integration and residue calculus to derive explicit parity formulas for (cyclotomic) multiple zeta values (MZVs). A key innovation lies in applying double shuffle regularization to the contour integrals,…

We consider a Gaussian process formulation of the multiple kernel learning problem. The goal is to select the convex combination of kernel matrices that best explains the data and by doing so improve the generalisation on unseen data.…

We present a method for computing the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. We have implemented our approach for some surfaces using the Magma programming language,…

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

In quantitative finance, it is often necessary to analyze the distribution of the sum of specific functions of observed values at discrete points of an underlying process. Examples include the probability density function, the hedging…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…