相关论文: Riesz means and Greedy Sums

In this paper, which is part of a study of positive representations of locally compact groups in Banach lattices, we initiate the theory of positive representations of finite groups in Riesz spaces. If such a representation has only the…

Using Euler transformation of series we relate values of Hurwitz zeta function at integer and rational values of arguments to certain rapidly converging series where some generalized harmonic numbers appear. The form of these generalized…

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…

We study, in three parts, degree sequences of k-families (or k-uniform hypergraphs) and shifted k-families. The first part collects for the first time in one place, various implications such as: Threshold implies Uniquely Realizable implies…

More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.

Stochastic iterative algorithms have gained recent interest in machine learning and signal processing for solving large-scale systems of equations, $Ax=b$. One such example is the Randomized Kaczmarz (RK) algorithm, which acts only on…

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$…

A $k$-submodular function naturally generalizes submodular functions by taking as input $k$ disjoint subsets, rather than a single subset. Unlike standard submodular maximization, which only requires selecting elements for the solution,…

We rewrite Riemann Zeta function as a sum over the primes. Each term of the sum is a product that depends only on the summation index (a prime) and the primes following it.

For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property…

Gordon and McMahon defined a two-variable greedoid polynomial $ f(G;t,z) $ for any greedoid $ G $. They studied greedoid polynomials for greedoids associated with rooted graphs and rooted digraphs. They proved that greedoid polynomials of…

Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…

A set $\mathcal S\subset \mathbb N$ is said to be a subset-sum-distinct or dissociated if all of its finite subsets have different sums. Alternately, an equivalent classification is if any equality of the form $$\sum_{s\in \mathcal S}…

We develop a simple and intuitive identity for calculating expectations of weighted $k$-fold sums over particles in branching processes, generalising the well-known many-to-one lemma.

The core of a game $v$ on $N$, which is the set of additive games $\phi$ dominating $v$ such that $\phi(N)=v(N)$, is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular…

We describe a canonical spanning tree of the ridge graph of a subword complex on a finite Coxeter group. It is based on properties of greedy facets in subword complexes, defined and studied in this paper. Searching this tree yields an…

Let $\gamma$ denote imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Certain sums over the $\gamma$'s are evaluated, by using the function $G(s) = \sum_{\gamma>0}\gamma^{-s}$ and other techniques. Some integrals…

Let $\psi$ denote the Dedekind totient function defined by $ \psi(n)=\sum_{d|n}d\mu^2\l({n}/{d}\r) $ with $\mu$ being the M\"{o}bius function. We shall consider the $k$-th Riesz mean of the arithmetical function $n/\psi(n)$ for any…

We introduce the concept of crossed product of a product system by a locally compact group. We prove that the crossed product of a row-finite and faithful product system by an amenable group is also a row-finite and faithful product system.…

Consider two ordered positive real number arrays of equal size. The problem is to find such set of indices of given size that the ratio of the sums of the array elements with those indices is minimized. In this work, in order to mitigate…