Related papers: Greedy Sums and Dirichlet Series

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.

A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…

We consider products of $q$-gamma functions with rational arguments, and prove several $q$-generalizations of recent works concerning products of gamma functions. In particular, we consider products indexed by Dirichlet characters, and…

If $G$ is a solvable group, we take $\Delta (G)$ to be the character degree graph for $G$ with primes as vertices. We prove that if $\Delta (G)$ is a square, then $G$ must be a direct product.

We consider a sum of the derivatives of Dirichlet $L$-functions over the zeros of Dirichlet $L$-functions. We give an asymptotic formula for the sum.

We show that every even number $>\exp\exp 36$ can be represented as the sum of a prime and a product of at most two primes.

An increasing sequence $(x_i)_{i=1}^n$ of positive integers is an $n$-term Egyptian underapproximation of $\theta \in (0,1]$ if $\sum_{i=1}^n \frac{1}{x_i} < \theta$. A greedy algorithm constructs an $n$-term underapproximation of $\theta$.…

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…

It is proved that given any three conditionally convergent series of real numbers, there is a single sequence of natural numbers such that each of the corresponding three subseries sums to either $\infty$ or $-\infty$. An example is…

We prove a connectedness result for products of weighted projective spaces.

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

We give an axiomatic characterization of multiple Dirichlet series over the function field $\mathbb F_q(T)$, generalizing a set of axioms given by Diaconu and Pasol. The key axiom, relating the coefficients at prime powers to sums of the…

For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the…

We show that every sum system is divisible. Combined with B. V. R. Bhat and R. Srinivasan's result, this shows that every product system arising from a sum system (and every generalized CCR flow) is either of type I or type III. A…

We develop an analytic approach that draws on tools from Fourier analysis and ergodic theory to study Ramsey-type problems involving sums and products in the integers. Suppose $Q$ denotes a polynomial with integer coefficients. We establish…

This note is a continuation of an earlier paper by the authors. We describe improved constructions addressing a question of Erd\H{o}s and Szemer\'edi on sums and products of real numbers along the edges of a graph. We also add a few…

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…