Related papers: Slack matrices, $k$-products, and $2$-level polyto…
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…
We give a geometric method for determining the cohomology groups of a polyhedral product under suitable freeness conditions or with coefficients taken in a field. This is done by considering first the special case for which the pairs of…
For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…
We prove that every holomorphic symplectic matrix can be factorized as a product of holomorphic unitriangular matrices with respect to the symplectic form $ \left[\begin{array}{ccc} 0 & L_n \\ -L_n & 0\end{array}\right]$ where $L$ is the $n…
We numerically determine the S-matrix by using connection formulae in the modular linear differential equation (MLDE) approach to the holomorphic modular bootstrap. We then determine exact formulae using the fact that entries in the…
Multilevel/multigrid methods is one of the most popular approaches for solving a large sparse linear system of equations, typically, arising from the discretization of partial differential equations. One critical step in the…
We study the problem of learning a distribution from samples, when the underlying distribution is a mixture of product distributions over discrete domains. This problem is motivated by several practical applications such as crowd-sourcing,…
This article introduces HODLR2D, a new hierarchical low-rank representation for a class of dense matrices arising out of $N$ body problems in two dimensions. Using this new hierarchical framework, we propose a new fast matrix-vector product…
The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…
Let $M=(E,{\cal I})$ be a matroid. A {\em $k$-truncation} of $M$ is a matroid {$M'=(E,{\cal I}')$} such that for any $A\subseteq E$, $A\in {\cal I}'$ if and only if $|A|\leq k$ and $A\in {\cal I}$. Given a linear representation of $M$ we…
The determination of the density functions for products of random elements from specified classes of matrices is a basic problem in random matrix theory and is also of interest in theoretical physics. For connected simple Lie groups of…
This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field). This class was introduced, in a different language, by…
Using the framework of the quantum separation of variables (SoV) for higher rank quantum integrable lattice models [1], we introduce some foundations to go beyond the obtained complete transfer matrix spectrum description, and open the way…
A low-rank transformation learning framework for subspace clustering and classification is here proposed. Many high-dimensional data, such as face images and motion sequences, approximately lie in a union of low-dimensional subspaces. The…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
In this paper we examine the model matching problem that concerns nonlinear input - output discrete systems, containing products among delays of input and output signals, through a special factorization. The algebraic framework of $\de…
We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik--Zamolodchikov equations, which arise by considering representations of the…
Which matrices can be written as sums or products of square-zero matrices? This question is the central premise of this dissertation. Over the past 25 years a significant body of research on products and linear combinations of square-zero…
The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \circ B$, where $\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…