Related papers: Finite N\"orlund Summation Methods

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

We study the convergence of the Hermite series of measurable functions on the real line. We characterize the norm convergence of truncated partial Hermite sums in rearrangement invariant spaces provided that the truncations vanish…

We generalize the classical Olivier's theorem which says that for any convergent series $\sum_n a_n$ with positive nonincreasing real terms the sequence $(n a_n)$ tends to zero. Our results encompass many known generalizations of Olivier's…

For an array $\left\{X_{n,j}, \, 1 \leqslant j \leqslant k_{n}, n \geqslant 1 \right\}$ of random variables and a sequence $\{c_{n} \}$ of positive numbers, sufficient conditions are given under which, for all $\varepsilon > 0$,…

We introduce a general definition of almost $p$-summing mappings and give several concrete examples of such mappings. Some known results are considerably generalized and we present various situations in which the space of almost $p$-summing…

We propose a fast proximal Newton-type algorithm for minimizing regularized finite sums that returns an $\epsilon$-suboptimal point in $\tilde{\mathcal{O}}(d(n + \sqrt{\kappa d})\log(\frac{1}{\epsilon}))$ FLOPS, where $n$ is number of…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…

We give a vector identity for $n+2$ points in $\mathbb R^n$. It follows as a corollary that when $n$ is odd the sum of the signed volumes of the $n$-simplices is zero, and when $n$ is even, the alternating sum of the signed volumes is zero.

Let $p$ be an odd prime and let $f(x)=\sum_{i=1}^ka_ix^{p^{\alpha_i}+1}\in\Bbb F_{p^n}[x]$, where $0\le \alpha_1<...<\alpha_k$. We consider the exponential sum $S(f,n)=\sum_{x\in\Bbb F_{p^n}}e_n(f(x))$, where $e_n(y)=e^{2\pi…

We consider the problem of minimizing a sum of $n$ functions over a convex parameter set $\mathcal{C} \subset \mathbb{R}^p$ where $n\gg p\gg 1$. In this regime, algorithms which utilize sub-sampling techniques are known to be effective. In…

The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…

In this paper we investigate the infinite convergent sum $T=\sum_{n=0}^\infty\frac{P(n)}{Q(n)}$, where $P(x)\in\bar{\mathbb{Q}}[x]$, $Q(x)\in\mathbb{Q}[x]$ and $Q(x)$ has only simple rational zeros. N. Saradha and R. Tijdeman have obtained…

This is an expanded version of our earlier paper. Let the $n$th partial sum of the Taylor series $e = \sum_{r=0}^{\infty} 1/r!$ be $A_n/n!$, and let $p_k/q_k$ be the $k$th convergent of the simple continued fraction for $e$. Using a recent…

Let X_1,X_2, . . . be a sequence of i.i.d. mean zero random variables and let S_n the sum of the first n random variables. We show that whenever lim sup_n |S_n|/c_n is finite with probability one and the normalizing sequence {c_n} is…

We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for $n$ data points requires $\Omega(n^2)$ similarity computations. This quadratic…

In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…

The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…

We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…

We present a relation between convergence of multiple and single orthogonal series. This relation implies a complete characterization of all multiple sequences $(a_{n_1...n_d})_{n_1,...,n_d\in\bb N}$ such that for all orthonormal…