Related papers: Riesz means and Greedy Sums
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of…
This study presents explicit evaluations of the series \begin{equation*} \sum_{k=1}^\infty \frac{H_{k/n}^{(p)}}{k^q} \quad \text{and} \quad \sum_{k=1}^\infty \frac{(-1)^k H_{k/2n}^{(p)}}{k^q}, \quad p,q,n \in \mathbb{Z}_{\ge 1},\; q \ne 1,…
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we extend some of the notions that appear naturally in connection with these algorithms to the…
The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…
In this paper, we introduce a geometrical summation method that makes the original Riemann series converge over the critical strip. This method gives an analytical function, that coincides with z\^eta. This point of view allows us to…
In correspondence with Goldbach, Euler began investigating series of the form $\sum_{k \geq 1} k^{-m}\left(1 + 2^{-n} + \cdots + k^{-n}\right)$, which are known today as Euler sums. For the case where $n=1$ and $m \geq 2$, Euler was able to…
We give criteria for finding the greedy $\beta$-expansion for $1$ for families of Salem numbers that approach a given Pisot number. We show that these expansions are related to the greedy expansion under the Pisot base. This expands on the…
An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor $\lambda > 1$ in the condition defining the greedy property, then we obtain an equivalence of the almost greedy property, a strictly weaker…
Positive polynomials arising from Muirhead's inequality, from classical power mean and elementary symmetric mean inequalities and from Minkowski's inequality can be rewritten as sums of squares.
The main aim of this paper is to study an analogue of the generalized divisor function in a number field $\mathbb{K}$, namely, $\sigma_{\mathbb{K},\alpha}(n)$. The Dirichlet series associated to this function is…
Closeness is a widely-used centrality measure in social network analysis. For a node it indicates the reciprocal of the average shortest-path distance to the other nodes of the network. While the identification of the k nodes with highest…
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
We consider a generalized Gauss sum supported on matrices over a number field. We evaluate this Gauss sum and relate it to the number of totally isotropic subspaces of related quadratic spaces. Then we consider a further generalization of…
The nonlinear Kaczmarz method was recently proposed to solve the system of nonlinear equations. In this paper, we first discuss two greedy selection rules, i.e., the maximum residual and maximum distance rules, for the nonlinear Kaczmarz…
The sum $S(h,k):=\sum_{j=1}^{k-1}(-1)^{j+1+[hj/k]}$ appears in the modular transformation formulae of the classical theta function $\vartheta_3(z)$. The double sum $S(k) := \sum_{h=1}^{k-1}S(h,k)$ has a remarkable distribution of values.…
In this paper, we focus on the existence of accumulation points of the subset defined by the real projection of the zeros of the partial sums of the Riemann zeta functions. That would imply the existence of an infinite amount of zeros of…
We consider analytic functions of the Riemann zeta type, for which, if $s$ is a zero, so is $1-s$. We use infinite product representations of these functions, assuming their zeros to be of first order. We use exponential factors to…
We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these…
Here we generalize the concept of spatial tensor product, introduced by Skeide, of two product systems via a pair of normalized units. This new notion is called amalgamated tensor product of product systems, and now the amalgamation can be…