Related papers: Caratheodory type representation with unit weights…

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Let $b,n\in \mathbb{Z}$, $n\geq 1$, and ${\cal D}_1, \ldots, {\cal D}_{\tau(n)}$ be all positive divisors of $n$. For $1\leq l \leq \tau(n)$, define ${\cal C}_l:=\lbrace 1 \leqslant x\leqslant n \; : \; (x,n)={\cal D}_l\rbrace$. In this…

This letter presents a novel approach for \mbox{efficiently} computing time-index powered weighted sums of the form $\sum_{n=0}^{N-1} n^{K} v[n]$ using cascaded accumulators. Traditional direct computation requires $K{\times}N$ general…

Let $(\lambda\_n)$ be a strictly increasing sequence of positive integers. Inspired by the notions of topological multiple recurrence and disjointness in dynamical systems, Costakis and Tsirivas have recently established that there exist…

Recently we have started a program to describe the action of Lie algebras associated with Dynkin-type diagrams on generic Verma modules in terms of polynomial vector fields. In this paper we explain that the results for the classical ABCD…

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.

Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…

We generalize the universal power series of Seleznev to several variables and we allow the coefficients to depend on parameters. Then, the approximable functions may depend on the same parameters. The universal approximation holds on…

We present explicit formulas for the following family of parametric binomial sums involving harmonic numbers for $p=0,1,2$ and $|t|\leq1$. $$ \sum_{k=1}^{\infty}\frac{H_{k-1}t^k}{k^p\binom{n+k}{k}}\quad \mbox{and}\quad…

The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…

Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

The Ramanujan sum $c_n(k)$ is defined as the sum of $k$-th powers of the primitive $n$-th roots of unity. We investigate arithmetic functions of $r$ variables defined as certain sums of the products $c_{m_1}(g_1(k))...c_{m_r}(g_r(k))$,…

Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

A distinctive problem of harmonic analysis on $\R$ with respect to a Borel probability measure $\mu$ is identifying all $t\in\R$ such that both \[\left\{e^{-2\pi i\lambda x}: \lambda\in\Lambda\right\}\quad\text{and}\quad \left\{e^{-2\pi…

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…