Related papers: A criterion of contractivity for four by four uppe…
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…
Parametrization of complex 4 x 4 - matrices G in terms of Dirac tensor parameters (A,B,A_{l},B_{l},F_{kl}) or equivalent four complex 4-vectors (k,m,n,l) is investigated. In the given parametrization, the problem of inverting any 4 x 4…
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.…
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
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…
Based on work presented in [4], we define $S^2$-Upper Triangular Matrices and $S^2$-Lower Triangular Matrices, two special types of $d\times d(2d-1)$ matrices generalizing Upper and Lower Triangular Matrices, respectively. Then, we show…
We determine, for the first time, the scaling dimensions of a family of fixed-charge operators stemming from the critical $O(N)$ model in 4-$\epsilon$ dimensions to the leading and next to leading order terms in the charge expansion but to…
The dominant method for defining multivariate operator means is to express them as fix-points under a contraction with respect to the Thompson metric. Although this method is powerful, it crucially depends on monotonicity. We are developing…
It is known that the set of all solutions of a commutant lifting and other interpolation problems admits a Redheffer linear-fractional parametrization. The method of unitary coupling identifies solutions of the lifting problem with minimal…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We derive bounds on the entanglement of formation of states of a 4xN bipartite system using two entanglement monotones constructed from operational separability criteria. The bounds are used simultaneously as constraints on the entanglement…
In this paper, we study Brownian-type operators, which are upper triangular $2\times 2$ block matrix operators with entries satisfying some algebraic constraints. We establish a lifting theorem stating that any Brownian-type operator with…
A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…
The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If M is an orthogonal matrix, then a digraph which supports M…
Toeplitz matrices are characterized by their constant diagonals, have been extensively studied in various settings, including over real and complex numbers. However, their study over quaternions is quite sparse. In this paper, we…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…