Related papers: Finite N\"orlund Summation Methods

There is not much that can be said for all $x$ and for all $n$ about the sum \[ \sum_{k=1}^n \frac{1}{|\sin k\pi x|}. \] However, for this and similar sums, series, and products, we can establish results for almost all $x$ using the tools…

We obtain a uniform ergodic theorem for the sequence $\frac1{s(n)} \sum_{k=0}^n(\varDelta s)(n-k)\,T^k$, where $\varDelta$ is the inverse of the endomorphism on the vector space of scalar sequences which maps each sequence into the sequence…

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

We use the non-perturbative renormalization group to clarify some features of perturbation theory in thermal field theory. For the specific case of the scalar field theory with O(N) symmetry, we solve the flow equations within the local…

We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…

We prove a convergence theorem for partial sums of sectorial forms with vertex zero and a common semi-angle. As an example we prove an absorption theorem for sectorial forms.

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

We obtain new Poisson type summation formulas with nodes $\pm \sqrt{n}$ and with weights involving the function $r_k(n)$ that gives the number of representations of a positive integer $n$ as the sum of $k$ squares. Our results extend…

A generalised summation method is considered based on the Fourier series of periodic distributions. It is shown that $$ e^{it}-2e^{2it}+3e^{3it}-4e^{4it}+-\cdots = {\mathrm P\mathrm f} {\displaystyle \frac{e^{it}}{(1+e^{it})^2}} +i\pi…

Number of results in number theory have been developed using a new method. The Goldbach binary conjecture in strengthened formulation have been among them.

In this paper, the Newton-Anderson method, which results from applying an extrapolation technique known as Anderson acceleration to Newton's method, is shown both analytically and numerically to provide superlinear convergence to non-simple…

This article extends our previous study on the summatory behavior of Euler's totient function $\varphi(n)$. We investigate two complementary restricted sums, $\Upsilon(x,p)=\sum_{\substack{k\le x\\\gcd(k,p)=1}}\varphi(k)$ and…

Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…

In this paper we study the auxiliary problems that appear in $p$-order tensor methods for unconstrained minimization of convex functions with $\nu$-H\"{o}lder continuous $p$th derivatives. This type of auxiliary problems corresponds to the…

In this paper we give a systematized treatment to some coincidence situations for multiple summing multilinear mappings which extend, generalize and simplify the methods and results obtained thus far. The application of our general results…

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

For decreasing sequences $\{t_{n}\}_{n=1}^{\infty}$ converging to zero, we obtain the almost everywhere convergence results for sequences of Schr\"{o}dinger means $e^{it_{n}\Delta}f$, where $f \in H^{s}(\mathbb{R}^{N}), N\geq 2$. The…

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.