Related papers: The p-norm of some matrices

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…

We study the $\ell^\infty \to \ell^\infty$ operator norm of products of independent random matrices with independent and identically distributed entries. For $n$-by-$n$ matrices whose entries are centered, have unit variance, and have a…

We compute the modular transformation formula of the characters for a certain family of (finitely or uncountably many) simple modules over the simple $\mathcal{N}=2$ vertex operator superalgebra of central charge…

This work performs a study of the category of complete matrix-normed spaces, called matricial Banach spaces. Many of the usual constructions of Banach spaces extend in a natural way to matricial Banach spaces, including products, direct…

We characterize classes of linear maps between operator spaces $E$, $F$ which factorize through maps arising in a natural manner via the Pisier vector-valued non-commutative $L^p$ spaces $S_p[E^*]$ based on the Schatten classes on the…

We prove that the logarithm of the permanent of an nxn real matrix A and the logarithm of the hafnian of a 2nx2n real symmetric matrix A can be approximated within an additive error 1 > epsilon > 0 by a polynomial p in the entries of A of…

Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…

We analyze the precision of the characteristic polynomial of an $n\times n$ p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Inspired by the bad scientist who keeps repeating an experiment 20 times to get a single outcome with $p < 0.05$, we consider matrices $A \in \mathbb{R}^{n \times n}$ whose rows are normalized in $\ell^2$ and for which $2^{-n}\sum_{x \in…

In this paper, we first study the sharp weak estimate for the $p$-adic $n$-dimensional fractional Hardy operator from $L^p$ to $L^{q,\infty}$. Secondly, we study the sharp bounds for the $m$-linear $n$-dimensional $p$-adic integral operator…

In this paper, by introducing some parameters, we define and study certain $p$-adic Hardy-Littlewood-P\'{o}lya-type integral operators acting on $p$-adic weighted Lebesgue spaces. We completely characterize $L^{q}-L^{r}$ boundedness of…

Let $\|A\|_{p,q}$ be the norm induced on the matrix $A$ with $n$ rows and $m$ columns by the H\"older $\ell_p$ and $\ell_q$ norms on $R^n$ and $R^m$ (or $C^n$ and $C^m$), respectively. It is easy to find an upper bound for the ratio…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

In this article we study the generalized Hilbert matrix operator $\Gamma_\mu$ acting on the Bergman spaces $A^p$ of the unit disc for $1\leq p<\infty$. In particular, we characterize the measures $\mu$ for which the operator $\Gamma_\mu$ is…

In this paper we consider symmetric, positive semidefinite (SPSD) matrix $A$ and present two algorithms for computing the $p$-Schatten norm $\|A\|_p$. The first algorithm works for any SPSD matrix $A$. The second algorithm works for…

The $p$-norm of $r$-matrices generalizes the $2$-norm of $2$-matrices. It is shown that if a nonnegative $r$-matrix is symmetric with respect to two indices $j$ and $k$, then the $p$-norm is attained for some set of vectors such that the…

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

We define norms on $L_p(\mathcal{M}) \otimes M_n$ where $\mathcal{M}$ is a von Neumann algebra and $M_n$ is the complex $n \times n$ matrices. We show that a linear map $T: L_p(\mathcal{M}) \to L_q(\mathcal{N})$ is decomposable if…

By extending the methods used in our earlier work, in this paper, we present an explicit realization of logarithmic $\mathcal{W}_{p,p'$}-modules that have L(0) nilpotent rank three. This was achieved by combining the techniques developed in…