English
Related papers

Related papers: Criterion of unitary similarity for upper triangul…

200 papers

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…

Functional Analysis · Mathematics 2009-08-18 James E. Tener

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Representation Theory · Mathematics 2014-03-12 Tatiana G. Gerasimova , Roger A. Horn , Vladimir V. Sergeichuk

Two matrices $A$ and $B$ are called unitary (resp. orthogonal) equivalent if $AU=VB$ for two unitary (resp. orthogonal) matrices $U$ and $V$. Using trace identities, criteria are given for simultaneous unitary, orthogonal or complex…

Rings and Algebras · Mathematics 2020-08-05 Naihuan Jing

We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods. We discuss these differences and…

Functional Analysis · Mathematics 2010-03-16 Stephan Ramon Garcia , Daniel E. Poore , Madeline K. Wyse

We present necessary and sufficient conditions for an n\times n complex matrix B to be unitarily similar to a fixed unicellular (i.e., indecomposable by similarity) n\times n complex matrix A

Representation Theory · Mathematics 2015-03-17 Douglas Farenick , Tatiana G. Gerasimova , Nadya Shvai

This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…

Numerical Analysis · Mathematics 2013-03-11 Yuri R. Nesterenko

We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…

Functional Analysis · Mathematics 2010-03-16 Stephan Ramon Garcia , Levon Balayan

The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at…

Number Theory · Mathematics 2008-06-10 Aicardi Francesca

This paper continues the authors' work on the question of unitary equivalence of matrices with entries in the complex-valued functions of a topological space (matrices over spaces). Specifically, we here consider the question of unitary…

Operator Algebras · Mathematics 2022-05-30 Greg Friedman , Efton Park

A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…

Representation Theory · Mathematics 2010-06-15 Jinpeng An , Dragomir Z. Djokovic

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

Representation Theory · Mathematics 2024-08-09 Vitaliy Bondarenko , Anatoliy Petravchuk , Maryna Styopochkina

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

Representation Theory · Mathematics 2007-10-04 Genrich R. Belitskii , Vladimir V. Sergeichuk

A conjecture posed by S. Hayajneh and F. Kittaneh claims that given $A,B$ positive matrices, $0\le t\le 1$, and any unitarily invariant norm it holds $|||A^tB^{1-t}+B^tA^{1-t}|||\le|||A^tB^{1-t}+A^{1-t}B^t|||$. Recently, R. Bhatia proved…

Functional Analysis · Mathematics 2014-03-31 Tamara Bottazzi , Rene Elencwajg , Gabriel Larotonda , Alejandro Varela

Motivated by a problem of Halmos, we obtain a canonical decomposition for complex matrices which are unitarily equivalent to their transpose (UET). Surprisingly, the naive assertion that a matrix is UET if and only if it is unitarily…

Functional Analysis · Mathematics 2016-11-14 Stephan Ramon Garcia , James E. Tener

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…

Operator Algebras · Mathematics 2018-12-31 Greg Friedman , Efton Park

A question of interest in Linear Algebra is whether all n x n complex matrices can be unitarily tridiagonalised. The answer for all n not equal to 4 (affirmative or negative) has been known for a while, whereas the case n=4 seems to have…

Rings and Algebras · Mathematics 2007-05-23 Vishwambhar Pati

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

Combinatorics · Mathematics 2021-06-04 Christos A. Athanasiadis

Chien, Liu, Nakazato, and Tam proved that all n by n classical Toeplitz matrices (one-level Toeplitz matrices) are unitarily similar to complex symmetric matrices via two types of unitary matrices and the type of the unitary matrices only…

Functional Analysis · Mathematics 2019-06-26 Lei Cao , Selcuk Koyuncu

A matrix $T \in \M_n(\C)$ is \emph{UECSM} if it is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. We develop several techniques for studying this property in dimensions three and four. Among other things, we…

Functional Analysis · Mathematics 2012-09-04 Stephan Ramon Garcia , Daniel E. Poore , James E. Tener

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Computational Complexity · Computer Science 2024-10-04 Abhranil Chatterjee , Sumanta Ghosh , Rohit Gurjar , Roshan Raj
‹ Prev 1 2 3 10 Next ›