Related papers: Moore-Penrose Dagger Categories
We prove the (generalized) principal pivot transform is matrix monotone, in the sense of the L\"owner ordering, under minimal hypotheses. This improves on the recent results of J. E. Pascoe and R. Tully-Doyle, Monotonicity of the principal…
An algebraic interpretation of matrix-valued orthogonal polynomials (MVOPs) is provided. The construction is based on representations of a ($q$-deformed) Lie algebra $\mathfrak{g}$ into the algebra $\operatorname{End}_{M_n(\mathbb{C})}(M)$…
Let $S$ be a $*$-semigroup and let $a,w,v\in S$. The initial goal of this work is to introduce two new classes of generalized inverses, called the $w$-core inverse and the dual $v$-core inverse in $S$. An element $a\in S$ is $w$-core…
In this paper we examine an inverse problem in the modular theory of von Neumann algebras in the case of finite factors. First we give a characterization of cyclic and separating vectors for finite factors in terms of operators associated…
We give a categorical setting in which Penrose graphical calculus naturally extends to graphs drawn on the boundary of a handlebody. We use it to introduce invariants of 3-manifolds presented by Heegaard splittings. We recover Kuperberg…
The notion of the weighted core inverse in a ring with involution was introduced, recently [Mosic et al. Comm. Algebra, 2018; 46(6); 2332-2345]. In this paper, we explore new representation and characterization of the weighted core inverse…
Knutson introduced two families of reverse juggling Markov chains (single and multispecies) motivated by the study of random semi-infinite matrices over $\mathbb{F}_q$. We present natural generalizations of both chains by placing generic…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
A cumbersome operation in many scientific fields, is inverting large full-rank matrices. In this paper, we propose a coded computing approach for recovering matrix inverse approximations. We first present an approximate matrix inversion…
We classify the different ways in which matrix product states (MPSs) can stay invariant under the action of matrix product operator (MPO) symmetries. This is achieved through a local characterization of how the MPSs, that generate a ground…
Matrix Product States (MPS) are a particular type of one dimensional tensor network states, that have been applied to the study of numerous quantum many body problems. One of their key features is the possibility to describe and encode…
We study an inverse problem involving the unique recovery of several lower order anisotropic tensor perturbations of a polyharmonic operator in a bounded domain from the knowledge of the Dirichlet to Neumann map on a part of boundary. The…
This thesis develops the categorical proof theory for the non-compact multiplicative dagger linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The existing frameworks of CQM are categorical proof…
While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
Inverse reinforcement learning is the problem of inferring a reward function from an optimal policy or demonstrations by an expert. In this work, it is assumed that the reward is expressed as a reward machine whose transitions depend on…
This paper generalizes the results obtained in an earlier paper (math.OA/0003087) for finite factors to infinite but still semifinite factors. First we give a characterization of cyclic and separating vectors for infinite semifinite factors…
The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the Distance Geometry Problem (DGP) whose search…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…