Related papers: Accretive Partial Transpose Matrices and Their Con…
An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…
Machine Translation (MT) evaluation metrics assess translation quality automatically. Recently, researchers have employed MT metrics for various new use cases, such as data filtering and translation re-ranking. However, most MT metrics…
We characterize real functions $f$ on an interval $(-\alpha,\alpha)$ for which the entrywise matrix function $[a_{ij}] \mapsto [f(a_{ij})]$ is positive, monotone and convex, respectively, in the positive semidefiniteness order. Fractional…
The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
We present a detailed analysis of a scalar conformal four-point function obtained from AdS/CFT correspondence. We study the scalar exchange graphs in AdS and discuss their analytic properties. Using methods of conformal partial wave…
We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…
Neural Machine Translation (NMT) models have shown remarkable performance but remain largely opaque in their decision making processes. The interpretability of these models, especially their internal attention mechanisms, is critical for…
For finite-dimensional operator systems $\mathcal{S}_{\mathsf T}$, ${\mathsf T} \in B({\mathcal H})^d$, we show that the local lifting property and $1$-exactness of $\mathcal{S}_{\mathsf T}$ may be characterized by measurements of the…
Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We obtain the topological expansion of the hermitian matrix model using its representation as a CFT on a hyperelliptic Riemann surface. To each branch point of the Riemann surface we associate an operator which represents a twist field…
Deploying neural networks on edge devices entails a careful balance between the energy required for inference and the accuracy of the resulting classification. One technique for navigating this tradeoff is approximate computing: the process…
We present a necessary and sufficient condition for a finite dimensional density matrix to be an extreme point of the convex set of density matrices with positive partial transpose with respect to a subsystem. We also give an algorithm for…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
An algebra $\mathcal{A}$ of $n\times n$ complex matrices is said to be \textit{idempotent compressible} if $E\mathcal{A}E$ is an algebra for all idempotents $E\in\mathbb{M}_n(\mathbb{C})$. Analogously, $\mathcal{A}$ is said to be…
An $n$-by-$n$ ($n\ge 3$) weighted shift matrix $A$ is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the $a_j$'s, called the weights of $A$, are complex numbers. Assume that all…
The multiplication of a matrix by its transpose, $A^T A$, appears as an intermediate operation in the solution of a wide set of problems. In this paper, we propose a new cache-oblivious algorithm (ATA) for computing this product, based upon…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
The class of stochastic matrices that have a stochastic $c$-th root for infinitely many natural numbers $c$ is introduced and studied. Such matrices are called arbitrarily finely divisible, and generalise the class of infinitely divisible…