Related papers: Absolutely summing multilinear operators via inter…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…
We prove the stability of isomorphisms between Banach spaces generated by interpolation methods introduced by Cwikel-Kalton-Milman-Rochberg which includes, as special cases, the real and complex methods up to equivalence of norms and also…
We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…
We solve an interpolation problem in $A^p_\alpha$ involving specifying a set of (possibly not distinct) $n$ points, where the $k^{\textrm{th}}$ derivative at the $k^{\textrm{th}}$ point is up to a constant as large as possible for functions…
In this article, we prove several multi-term refinements of Young type inequalities for both real numbers and operators improving several known results. Among other results, we prove \begin{eqnarray*}…
A big class of Feynman integrals, in particular, the coefficients of their Laurent series expansion w.r.t.\ the dimension parameter $\ep$ can be transformed to multi-sums over hypergeometric terms and harmonic sums. In this article, we…
Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…
In this paper we present the results announced in the recent work by the first, second, and fourth authors of the current paper concerning Rubio de Francia extrapolation for the so-called multilinear Muckenhoupt classes. Here we consider…
We derive modular parametrizations for certain infinite series whose summands involve central binomial coefficients and higher-order harmonic numbers. When the rates of convergence are certain rational numbers, modularity allows us to…
We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…
Let $p_1,p_2,\dots,p_n, a_1,a_2,\dots,a_n \in \N$, $x_1,x_2,\dots,x_n \in \R$, and denote the $k$th periodized Bernoulli polynomial by $\B_k(x)$. We study expressions of the form \[ \sum_{h \bmod{a_k}} \ \prod_{\substack{i=1\\ i\not=k}}^{n}…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
I present two new methods for exactly summing a set of floating-point numbers, and then correctly rounding to the nearest floating-point number. Higher accuracy than simple summation (rounding after each addition) is important in many…
We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…
We prove a sparse bound for the $m$-sublinear form associated to vector-valued maximal functions of Fefferman-Stein type. As a consequence, we show that the sparse bounds of multisublinear operators are preserved via $\ell^r$-valued…
Multipoint secant and interpolation methods are effective tools for solving systems of nonlinear equations. They use quasi-Newton updates for approximating the Jacobian matrix. Owing to their ability to more completely utilize the…
For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…