English
Related papers

Related papers: On lower and upper bounds of matrices

200 papers

The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2). More precisely, for any integer p\leq n -1, the rank is at…

Computational Complexity · Computer Science 2013-10-31 J. M. Landsberg

We study $l^{p}$ operator norms of weighted mean matrices using the approaches of Kaluza-Szeg\"o and Redheffer. As an application, we prove a conjecture of Bennett.

Functional Analysis · Mathematics 2008-08-31 Peng Gao

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

General Mathematics · Mathematics 2025-10-10 N. A. Carella

The positive semidefinite rank of a nonnegative $(m\times n)$-matrix~$S$ is the minimum number~$q$ such that there exist positive semidefinite $(q\times q)$-matrices $A_1,\dots,A_m$, $B_1,\dots,B_n$ such that $S(k,\ell) = \mbox{tr}(A_k^*…

Combinatorics · Mathematics 2013-11-19 Troy Lee , Dirk Oliver Theis

In this note we study the induced $p$-norm of circulant matrices $A(n,\pm a, b)$, acting as operators on the Euclidean space $\mathbb{R}^n$. For circulant matrices whose entries are nonnegative real numbers, in particular for $A(n,a,b)$, we…

Functional Analysis · Mathematics 2023-05-24 Ludovick Bouthat , Apoorva Khare , Javad Mashreghi , Frédéric Morneau-Guérin

We give a method for producing explicit bounds on $g(p)$, the least primitive root modulo $p$. Using our method we show that $g(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}}$ for $p>10^{56}$ where $r\geq 2$ is an integer parameter.…

Number Theory · Mathematics 2019-04-30 Kevin J. McGown , Tim Trudgian

We prove that the known sufficient conditions on the real parameters $(p,q)$ for which the matrix power mean inequality $((A^p+B^p)/2)^{1/p}\le((A^q+B^q)/2)^{1/q}$ holds for every pair of matrices $A,B>0$ are indeed best possible. The proof…

Functional Analysis · Mathematics 2013-04-05 Koenraad M. R. Audenaert , Fumio Hiai

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

Computational Complexity · Computer Science 2019-05-15 Joel Friedman

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

We investigate a rearrangement inequality for pairs of n-square matrices: Let |A\|_p denote the C^p trace norm of an n-square matrix A. Consider the quantity |A+B|_p^p + |A-B|_p^p. Under certain positivity conditions, we show that this is…

Operator Algebras · Mathematics 2007-05-23 Eric Carlen , Elliott H. Lieb

In this paper, we considered the problem of finding the upper bound Hausdorff matrix operator from sequence spaces $l_p(v)$ (or $d(v,p)$) into $l_p(w)$ (or $d(w,p)$). Also we considered the upper bound problem for matrix operators from…

Functional Analysis · Mathematics 2007-05-23 R Lashkaripour , D Foroutannia

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…

Optimization and Control · Mathematics 2025-09-10 Igor Klep , Victor Magron , Gaël Massé , Jurij Volčič

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

Michel proved that for a one-parameter family of elliptic curves over Q(T) with non-constant j(T) that the second moment of the number of solutions modulo p is p^2 + O(p^{3/2}). We show this bound is sharp by studying y^2 = x^3 + Tx^2 + 1.…

Number Theory · Mathematics 2010-09-15 Steven J. Miller

We study the $l^p$ norms of a class of weighted mean matrices whose diagonal terms are given by $n^{\alpha}/\sum^{n}_{i=1}i^{\alpha}$ with $\alpha > -1$. The $l^p$ norms of such matrices are known for $p \geq 2, (\alpha+1)p >1$ and $1<p…

Functional Analysis · Mathematics 2019-12-03 Peng Gao , Huayu Zhao

An upper bound on operator norms of compound matrices is presented, and special cases that involve the $\ell_1$, $\ell_2$ and $\ell_\infty$ norms are investigated. The results are then used to obtain bounds on products of the largest or…

Rings and Algebras · Mathematics 2007-05-23 Ludwig Elsner , Daniel Hershkowitz , Hans Schneider

We deal with existence and uniqueness of positive solutions of an elliptic boundary value problem modeled by \begin{equation*} \begin{cases} \displaystyle -\Delta_p u= \frac{f}{u^\gamma} + g u^q & \mbox{in $\Omega$,} \\ u = 0 & \mbox{on…

Analysis of PDEs · Mathematics 2023-11-09 Riccardo Durastanti , Francescantonio Oliva

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

Computational Geometry · Computer Science 2026-02-23 Robert Krauthgamer , Nir Petruschka

In this paper we present a rare combination of abstract results on the spectral properties of slanted matrices and some of their very specific applications to frame theory and sampling problems. We show that for a large class of slanted…

Functional Analysis · Mathematics 2007-05-31 A. Aldroubi , A. Baskakov , I. Krishtal

Let $\mathcal{F}$ be a family of subsets of $[n]$ and $L$ be a subset of $[n]$. We say $\mathcal{F}$ is an $L$-differencing Sperner system if $|A\setminus B|\in L$ for any distinct $A,B\in\mathcal{F}$. Let $p$ be a prime and $q$ be a power…

Combinatorics · Mathematics 2026-04-22 Zixiang Xu , Chi Hoi Yip