Related papers: Sum-product estimates for diagonal matrices

The numerical analysis of gradient inclusions in a compact subset of $2\times 2$ diagonal matrices is studied. Assuming that the boundary conditions are reached after a finite number of laminations and using piecewise linear finite…

The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…

Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

We present a new, explicit sum formula for symmetric Macdonald polynomials $P_\lambda$ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov--Faddeev (ZF)…

One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or…

The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…

We improve the best known sum-product estimates over the reals. We prove that \[ \max(|A+A|,|AA|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,, \] for a finite $A\subset \mathbb R$, following a streamlining of the arguments of Solymosi,…

In a recent paper we have presented a method to evaluate certain Hankel determinants as almost products; i.e. as a sum of a small number of products. The technique to find the explicit form of the almost product relies on…

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

From mostly a measure-theoretic consideration, we show that for every nonnegative, finite, and $L^{1}$ function on a given finite measure space there is some nontrivial sequence of real numbers such that the series, obtained from summing…

We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of…

We develop a theoretical study of non-terminating hypergeometric summations with one free parameter. Composing various methods in complex and asymptotic analysis, geometry and arithmetic of certain transcendental curves and rational…

There is not much that can be said for all $x$ and for all $n$ about the sum \[ \sum_{k=1}^n \frac{1}{|\sin k\pi x|}. \] However, for this and similar sums, series, and products, we can establish results for almost all $x$ using the tools…

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…