Related papers: Riesz means and Greedy Sums
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…
To solve nonlinear problems, we construct two kinds of greedy capped nonlinear Kaczmarz methods by setting a capped threshold and introducing an effective probability criterion for selecting a row of the Jacobian matrix. The capped…
We start by introducing and studying the definition of a Riesz basis in a Krein space $(\mathcal{K},[.,.])$, along with a condition under which a Riesz basis becomes a Bessel sequence. The concept of biorthogonal sequence in Krein spaces is…
This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.
Directed graphs provide more subtle and precise modelling tools for optimization in road networks than simple graphs. In particular, they are more suitable in the context of alternative fuel vehicles and new automotive technologies, like…
The primary aim of this chapter is, commemorating the 150th anniversary of Riemann's death, to explain how the idea of {\it Riemann sum} is linked to other branches of mathematics. The materials I treat are more or less classical and…
We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…
Given a real number $\tau$, we study the approximation of $\tau$ by signed harmonic sums $\sigma_N(\tau) := \sum_{n \leq N}{s_n(\tau)}/n$, where the sequence of signs $(s_N(\tau))_{N \in\mathbb{N}}$ is defined "greedily" by setting…
We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…
Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…
In this paper, we consider a novel two-dimensional randomized Kaczmarz method and its improved version with simple random sampling, which chooses two active rows with probability proportional to the square of their cross-product-like…
For $a\in \Bbb Z$ and $b\in\Bbb N$, $(a,b)=1$, let $s(a,b)$ denote the classical Dedekind sum. We show that Dedekind sums take this value infinitely many times in the following sense. There are pairs $(a_i,b_i)$, $i\in\Bbb N$, with $b_i$…
Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…
Erd\H{o}s and Graham found it conceivable that the best $n$-term Egyptian underapproximation of almost every positive number for sufficiently large $n$ gets constructed in a greedy manner, i.e., from the best $(n-1)$-term Egyptian…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
In this paper we consider the generalized Walsh system and a problem $L^1- convergence$ of greedy algorithm of functions after changing the values on small set.
We develop appropriately generalized notions of indexability for problems of dynamic resource allocation where the resource concerned may be assigned more flexibility than is allowed, for example, in classical multi-armed bandits. Most…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.