Related papers: Algorithms for the Polar Decomposition in Certain …

In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…

Matrices of the irreducible representations of double crystallographic point groups O, Td, Ox{1,I} and Tdx{1,I} are derived. The characteristic polynomials (spinor bases) up to the sixth power are obtained. The method for the derivation of…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

We study certain polynomial trace identities in the group $SL(2,\IC)$ and their application in the theory of discrete groups. We obtain canonical representations for two generator groups in \S 4 and then in \S 5 we give a new proof for…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

To each 4x4 matrix of reals another 4x4 matrix is constructed, the so-called associate matrix. This associate matrix is shown to have rank 1 and norm 1 (considered as a 16D vector) if and only if the original matrix is a 4D rotation matrix.…

A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…

Any one measurement with polarized light makes it possible to fix the Mueller matrices of the Lorentz type with up to four arbitrary numeric parameters (x, u; z, w). These parameters are subject to the quadratic condition. It is…

We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…

We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

We construct interpolation operators for functions taking values in a symmetric space -- a smooth manifold with an inversion symmetry about every point. Key to our construction is the observation that every symmetric space can be realized…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…

In this paper, we propose a general algorithmic framework to solve a class of optimization problems on the product of complex Stiefel manifolds based on the matrix polar decomposition. We establish the weak convergence, global convergence…