Related papers: Greedy Sums and Dirichlet Series
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.
In this paper, we show that the regularized determinants of some Dirichlet series are multiplicative. As an application, we give generalizations of Lerch's formula for the classical gamma function and we determine the sum of some Dirichlet…
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…
We give a strong direct sum theorem for computing $xor \circ g$. Specifically, we show that for every function g and every $k\geq 2$, the randomized query complexity of computing the xor of k instances of g satisfies…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
We prove that the distribution of the product of two correlated normal random variables with arbitrary means and arbitrary variances is infinitely divisible. We also obtain exact formulas for the probability density function of the sum of…
We expand on the remark by Andrews on the importance of infinite sums and products in combinatorics. Let $\{g_d(n)\}_{d\geq 0,n \geq 1}$ be the double sequences $\sigma_d(n)= \sum_{\ell \mid n} \ell^d$ or $\psi_d(n)= n^d$. We associate…
In this note, we prove that for every two positive integers $m \geq n \geq 9$, there exist $n$ positive rational numbers whose product is 1 and sum is $m$.
Many identities written by $P=S=C$ are obtained, where $P$ infinite products, $S$ infinite series, and $C$ continued fractions. Such equality is called {\it triplicity}, and it can be used to compute the values of infinite series. It is…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
We prove a result related to Dirichlet spectrum for simultaneous approximation to two real numbers in Euclidean norm and badly or very well approximability.
We give a reciprocity formula for a two-variable sum where the variables satisfy a linear congruence condition. We also prove that such sum is a measure of how well a rational is approximable from below and show that the reciprocity formula…
We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…
We address the problems of minimizing and of maximizing the spectral radius overa compact family of non-negative matrices. Those problems being hard in generalcan be efficiently solved for some special families. We consider the so-called…
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.