Related papers: A scalar matching factor on the Birkhoff polytope …

In the first of this series of two articles, we studied some geometrical aspects of the Birkhoff polytope, the compact convex set of all $n \times n$ doubly stochastic matrices, namely the Chebyshev center, and the Chebyshev radius of the…

A \emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {\em binary} frequency squares of order $n$ with $n/2$ zeroes and $n/2$ ones in each row and column. Two…

In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…

We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column.…

We consider mixed type multiple orthogonal polynomials associated with a system of weight functions consisting of two vectors. One vector is defined in terms of scaled modified Bessel function of the first kind $I_\mu$ and $I_{\mu+1}$, the…

We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low…

We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…

In this paper, we study the topological spectrum of weighted Birkhoff averages over aperiodic and irreducible subshifts of finite type. We show that for a uniformly continuous family of potentials, the spectrum is continuous and concave…

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

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…

We study the multifractal analysis for smooth dynamical systems in dimension one. It is characterized the Hausdorff dimension of the level set obtained from the Birkhoff averages of a continuous function by the local dimensions of…

Birkhoff's variety theorem, a fundamental theorem of universal algebra, asserts that a subclass of a given algebra is definable by equations if and only if it satisfies specific closure properties. In a generalized version of this theorem,…

We introduce Polytopic Matrix Factorization (PMF) as a novel data decomposition approach. In this new framework, we model input data as unknown linear transformations of some latent vectors drawn from a polytope. In this sense, the article…

Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…

Separation of variables (SoV) is a special property of integrable models which ensures that the wavefunction has a very simple factorised form in a specially designed basis. Even though the factorisation of the wavefunction was recently…

Factor analysis aims to describe high dimensional random vectors by means of a small number of unknown common factors. In mathematical terms, it is required to decompose the covariance matrix $\Sigma$ of the random vector as the sum of a…

We compute the full probability distribution of the spectral form factor in the self-dual kicked Ising model by providing an exact lower bound for each moment and verifying numerically that the latter is saturated. We show that at large…

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

Maximizing a submodular function has a wide range of applications in machine learning and data mining. One such application is data summarization whose goal is to select a small set of representative and diverse data items from a large…