相关论文: Generalized Induced Norms

We investigate the category of ``matricial order operator spaces,'' which generalize operator systems, being equipped with both matricial norms and matricial order. For these objects, we develop duality theory. Taking a cue from the theory…

We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$…

In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.

We show that a normal matrix $A$ with coefficient in $\mathbb C[[X]]$, $X=(X_1, \ldots, X_n)$, can be diagonalized, provided the discriminant $\Delta_A $ of its characteristic polynomial is a monomial times a unit. The proof is an…

We investigate the deformation of involution and multiplication in a unital $C^*$-algebra when its norm is fixed. Our main result is to present all multiplications and involutions on a given $C^*$-algebra $\mathcal{A}$ under which…

Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…

Generalized Mersenne numbers are defined as $M_{p,n} = p^n - p + 1$, where $p$ is any prime and $n$ is any positive integer. Here, we prove that for each pair $(c, p)$ with $c\geq 1$ an integer, there is at most one $M_{p, n}$ of the form…

If a real-valued function is continuous on a real interval and it takes on two different values, then it will also take any value in between those two, by the Intermediate Value Theorem. It is not immediately clear what would be a natural…

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…

We propose a new framework that generalizes the parameters of neural network models to $C^*$-algebra-valued ones. $C^*$-algebra is a generalization of the space of complex numbers. A typical example is the space of continuous functions on a…

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Matrix norms can be used to measure the "distance" between two matrices which translates naturally to the problem of calculating the unitary deviation of the neutrino mixing matrices. Variety of matrix norms opens a possibility to measure…

Let X_N= (X_1^(N), ..., X_p^(N)) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1^(N), ..., Y_q^(N)), possibly random but independent of…

Every commuting set of normal matrices with entries in an AW*-algebra can be simultaneously diagonalized. To establish this, a dimension theory for properly infinite projections in AW*-algebras is developed. As a consequence, passing to…

The $\gamma_2$-norm of Boolean matrices plays an important role in communication complexity and discrepancy theory. In this paper, we study combinatorial properties of this norm, and provide new applications, involving Zarankiewicz type…

The main result of this short note is a generic version of Paz's conjecture on the lengths of generating sets in matrix algebras. Consider a generic g-tuple A=(A_1,..., A_g) of nxn matrices over a field. We show that whenever $g^{2d}\geq…

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…