Related papers: A scalar matching factor on the Birkhoff polytope …
Factor analysis refers to a statistical model in which observed variables are conditionally independent given fewer hidden variables, known as factors, and all the random variables follow a multivariate normal distribution. The parameter…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
We define the alternating sign matrix polytope as the convex hull of nxn alternating sign matrices and prove its equivalent description in terms of inequalities. This is analogous to the well known result of Birkhoff and von Neumann that…
Garret Birkhoff observed that any binary relation between two sets determines a Galois connection between the powersets, or equivalently, closure operators on the powersets, or equivalently, complete lattices of subsets that are dually…
We obtain necessary and sufficient conditions for a matrix $A$ to be Birkhoff-James orthogonal to another matrix $B$ in the Ky Fan $k$-norms. A characterization for $A$ to be Birkhoff-James orthogonal to any subspace $\mathscr W$ of…
In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…
A holomorphy potential is a complex valued function whose complex gradient, with respect to some K\"ahler metric, is a holomorphic vector field. Given $k$ holomorphic vector fields on a compact complex manifold, form, for a given K\"ahler…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Suleimanova is given via permutative matrices. In addition, we strengthen a well-known result by…
A vector-valued version of the Girsanov theorem is presented, for a scalar process with respect to a Banach-valued measure. Previously, a short discussion about the Birkhoff-type integration is outlined, as for example integration by…
The panstochastic analogue of Birkhoff's Theorem on doubly-stochastic matrices is proved in the case $n=5$. It is shown that this analogue fails when $n>1$, $n \ne 5$.
The bifactor model and its extensions are multidimensional latent variable models, under which each item measures up to one subdimension on top of the primary dimension(s). Despite their wide applications to educational and psychological…
This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…
Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. The theory of operator spaces provides a set up which describes 4 norm optimal factorizations of Grothendieck's sort.…
We consider three different approaches to define natural Riemannian metrics on polytopes of stochastic matrices. First, we define a natural class of stochastic maps between these polytopes and give a metric characterization of Chentsov type…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
The geometry of the Birkhoff polytope, i.e., the compact convex set of all $n \times n$ doubly stochastic matrices, has been an active subject of research. While its faces, edges and facets as well as its volume have been intensely studied,…