Related papers: Inclusion Matrices and Chains
This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…
This paper presents two alternative approaches for counting the number of two-row weakly increasing matrices, which are $2\times n$ matrices whose entries are integers from $1$ to $k$ and are weakly increasing along all rows and columns,…
Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…
In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the…
This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…
We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…
We propose the notion of $k$-integration as a measure of equality of opportunity in social networks. A social network is $k$-integrated if there is a path of length at most $k$ between any two individuals, thus guaranteeing that everybody…
We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…
Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure. In this work,…
We prove a generalization to Jennrich's uniqueness theorem for tensor decompositions in the undercomplete setting. Our uniqueness theorem is based on an alternative definition of the standard tensor decomposition, which we call…
This paper develops an inferential framework for matrix completion when missing is not at random and without the requirement of strong signals. Our development is based on the observation that if the number of missing entries is small…
Given a Stirling permutation w, we introduce the mesa set of w as the natural generalization of the pinnacle set of a permutation. Our main results characterize admissible mesa sets and give closed enumerative formulas in terms of rational…
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…
We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between 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…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…
An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…
We propose a generalized Riemann-Hilbert-Birkhoff decomposition that expands the standard integrable hierarchy formalism in two fundamental ways: it allows for integer powers of Lax matrix components in the flow equations to be increased as…
Let $A$ be an $n\times n$ matrix and let $\vee^k A$ be its $k$-th symmetric tensor product. We express the normalized trace of $\vee^k A$ as an integral of the $k$-th powers of the numerical values of $A$ over the unit sphere…