Related papers: Sinkhorn normal form for unitary matrices
Columns of d^2 x N matrices are shown to create different sets of N operators acting on $d$-dimensional Hilbert space. This construction corresponds to a formalism of the star-product of operator symbols. The known bases are shown to be…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We investigate the equivalence theorem for integrable systems using two formulations of the Alday-Arutyunov-Frolov model. We show that the S-matrix is invariant under the field transformation which reduces the non-linear Dirac brackets of…
We give an algorithm that uses only unitary transformations and for each square complex matrix constructs a *congruent matrix that is a direct sum of a nonsingular matrix and singular Jordan blocks.
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
The bulk S-Matrix can be given a non-perturbative definition in terms of the flat space limit of AdS/CFT. We show that the unitarity of the S-Matrix, ie the optical theorem, can be derived by studying the behavior of the OPE and the…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
We introduce a new class of convex-regularized Optimal Transport losses, which generalizes the classical Entropy-regularization of Optimal Transport and Sinkhorn divergences, and propose a generalized Sinkhorn algorithm. Our framework…
The $n\times n$ doubly stochastic matrices constitute a polytope in $\mathbb{R}^{n^2}$, and by Birkhoff's theorem, its vertex set coincides with the set of order-$n$ permutation matrices.\\ A tristochastic array is an $n \times n\times n$…
We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…
An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has…
Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…
We initiate the S-matrix bootstrap analysis of theories with non-invertible symmetries in (1+1) dimensions. Our previous work showed that crossing symmetry of S-matrices in such theories is modified, with modification characterized by the…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…
It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on this equivalent formulation some adaptations of the power…
We prove that the squared singular values of a fixed matrix multiplied with a truncation of a Haar distributed unitary matrix are distributed by a polynomial ensemble. This result is applied to a multiplication of a truncated unitary matrix…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…
Denote $\mathcal{A}$ as the set of all doubly substochastic $m \times n$ matrices and let $k$ be a positive integer. Let $\mathcal{A}_k$ be the set of all $1/k$-bounded doubly substochastic $m \times n$ matrices, i.e., $\mathcal{A}_k…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…