Related papers: Sum-product estimates for diagonal matrices
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
This paper is devoted to a generalization of a Hadamard type inequality for the permanent of a complex square matrix. Our proof is based on a non-trivial extension of a technique used in Carlen, Lieb and Loss (Methods and Applications of…
A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…
In this note we generalize the trace inequality derived by [1] to the case where the number of terms of the sum (denoted by K) is arbitrary.
We use an extension of the diagrammatic rules in random matrix theory to evaluate spectral properties of finite and infinite products of large complex matrices and large hermitian matrices. The infinite product case allows us to define a…
Let $A$ and $B$ be Banach algebras and let $B$ be an algebraic Banach $A-$bimodule. Then the $\ell^1-$direct sum $A\times B$ equipped with the multiplication $$(a_1,b_1)(a_2,b_2)=(a_1a_2,a_1\cdot b_2+b_1\cdot a_2+b_1b_2),~~ (a_1, a_2\in A,…
In this work some results on the structure-preserving diagonalization of selfadjoint and skewadjoint matrices in indefinite inner product spaces are presented. In particular, necessary and sufficient conditions on the symplectic…
The classical Dedekind sums $s(d, c)$ can be represented as sums over the partial quotients of the continued fraction expansion of the rational $\frac{d}{c}$. Hardy sums, the analog integer-valued sums arising in the transformation of the…
In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the…
Let $SPP(n)$ be the set $\left\{\big(|A+A|,|A A|\big) : A\subseteq {\mathbb N}, |A|=n\right\}$ of sum-product pairs, where $A+A$ is the sumset $\{a+b : a,b\in A\}$ and $A A$ is the product set $\{ab:a,b\in A\}$. We construct a dataset…
We describe all inequalities among generalized diagonals in positive semi-definite matrices. These turn out to be governed by a simple partial order on the symmetric group. This provides an analogue of results of Drake, Gerrish, and…
We generalize the $2$-tensor paraproduct decomposition result of [arXiv:2503.12629] to $d$-tensors. In particular, we show that for $A \in C^{d}(\mathbb{R}), f \in \Lambda_{\alpha}([0,1]^d)$, $A(f)$ can be approximated by…
We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…
In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…
An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…
We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…
Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…
In this paper we consider four basic multidimensional matrix operations (outer product, Kronecker product, contraction, and projection) and two derivative operations (dot and circle products). We start with the interrelations between these…