Related papers: A note on Sonnenschein summability matrices
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
In this note, we establish a Vorono\"i--Oppenheim summation formula for divisor functions over an arbitrary number field.
We present a subtraction scheme for eliminating the ultraviolet, soft, and collinear divergences in the numerical calculation of an arbitrary one-loop QCD amplitude with an arbitrary number of external legs. The subtractions consist of…
We consider the canonical Wiener-Hopf factorisation of $2 \times 2$ symmetric matrices $\mathcal M$ with respect to a contour $\Gamma$. For the case that the quotient $q$ of the two diagonal elements of $\mathcal M$ is a rational function,…
This note presents a simple, universal closed form for the powers of any square matrix. A diligent search of the internet gave no indication that the form is known.
P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van…
In this paper we introduce an abstract approach to the notion of absolutely summing multilinear operators. We show that several previous results on different contexts (absolutely summing, almost summing, Cohen summing) are particular cases…
We show the integrality of the simple Hurwitz numbers. The main tool is the cut-and-join operator, and our proof is a purely combinatorial one.
In this article we present a simple proof of Borevich-Shafarevich's method to compute the sum of the first n natural numbers of the same power. We also prove several properties of Bernoulli's numbers.
This note gives a simple analysis of a randomized approximation scheme for matrix multiplication proposed by Sarlos (2006) based on a random rotation followed by uniform column sampling. The result follows from a matrix version of…
We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.
We present a randomized approximation algorithm for counting contingency tables, mxn non-negative integer matrices with given row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We define smooth margins (R,C) in terms of the…
In this paper, we study the alternating Euler $T$-sums and related sums by using the method of contour integration. We establish the explicit formulas for all linear and quadratic Euler $T$-sums and related sums. Some interesting new…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…
We shall show that the sum of the series formed by the so-called hyperharmonic numbers can be expressed in terms of the Riemann zeta function. More exactly, we give summation formula for the general hyperharmonic series.
Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for…
Integrals for the product of unitary-matrix elements over the U(n) group will be discussed. A group-theoretical formula is available to convert them into a multiple sum, but unfortunately the sums are often tedious to compute. In this…
We provide a simple method for the calculation of the terms c_n in the Zassenhaus product $e^{a+b}=e^a e^b \prod_{n=2}^{\infty} e^{c_n}$ for non-commuting a and b. This method has been implemented in a computer program. Furthermore, we…