Related papers: Sinkhorn normal form for unitary matrices

Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…

A basic problem in linear particle optics is to find a symplectic transformation that brings the (symmetric) beam matrix to a special diagonal form, called normal form. The conventional way to do this involves an eigenvalue-decomposition of…

We present two generalisations of Singular Value Decomposition from real-numbered matrices to dual-numbered matrices. We prove that every dual-numbered matrix has both types of SVD. Both of our generalisations are motivated by applications,…

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…

In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…

Using symmetry considerations, we derive a unitary scattering matrix for a three-port optical Y-coupler or Y-branch. The result is shown to be unique up to external phase shifts. Unlike traditional passive linear-optical one-way splitters,…

It is known by results of Dyckerhoff-Kapranov and of G\'alvez--Carrillo-Kock-Tonks that the output of the Waldhausen S.-construction has a unital 2-Segal structure. Here, we prove that a certain S.-functor defines an equivalence between the…

Given a totally positive matrix, can one insert a line (row or column) between two given lines while maintaining total positivity? This question was first posed and solved by Johnson and Smith who gave an algorithm that results in one…

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.

A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…

We construct a scattering theory for harmonic one-forms on Riemann surfaces, obtained from boundary value problems involving systems of curves and the jump problem. We obtain an explicit expression for the scattering matrix in terms of…

A neutral fixed point of a real iteration map $u$ becomes a super attracting fixed point using a suitable double newtonisation. The map $u$ is so transformed into a map $w$ which is here called the standard accelerator of $u$. The map $w$…

We provide an elementary proof for a theorem due to Petz and R\'effy which states that for a random $n\times n$ unitary matrix with distribution given by the Haar measure on the unitary group U(n), the upper left (or any other) $k\times k$…

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

A Steinhaus matrix is a binary square matrix of size $n$ which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy $a_{i,j}=a_{i-1,j-1}+a_{i-1,j}$ for all $2\leq i<j\leq n$. Steinhaus matrices are…

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…