Related papers: Saturation of 0-1 Matrices
We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…
We introduce two variants of the poset saturation problem. For a poset $P$ and the Boolean lattice $\mathcal{B}_n$, a family $\mathcal{F}$ of sets, not necessarily from $\mathcal{B}_n$, is \textit{projective $P$-saturated} if (i) it does…
Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters $D$ on $I$, $|I| = \lambda > \aleph_0$, the fact…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexity. Specifically, complexity of the sets of matrices…
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in…
Let $R$ be a Noetherian local ring and $m$ a positive integer. Let $I$ be the ideal of $R$ generated by the maximal minors of an $m \times (m + 1)$ matrix $M$ with entries in $R$. Assuming that the grade of the ideal generated by the…
Efficient resource allocation is one of the main driving forces of human civilizations. Of the many existing approaches to resource allocation, matrix completion is one that is frequently applied. In this paper, we investigate a special…
A matrix is \emph{simple} if it is a (0,1)-matrix and there are no repeated columns. Given a (0,1)-matrix $F$, we say a matrix $A$ has $F$ as a \emph{configuration}, denoted $F\prec A$, if there is a submatrix of $A$ which is a row and…
We study a family of combinatorial optimization problems defined by a parameter $p\in[0,1]$, which involves spectral functions applied to positive semidefinite matrices, and has some application in the theory of optimal experimental design.…
Our aim was to generalize some theorems about the saturation of ultra-powers to reduced powers. Naturally, we deal via saturation for types consisting of atomic formulas. We succeed to generalize the theory of dense linear is maximal and so…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…
Let $F$ and $H$ be $k$-uniform hypergraphs. We say $H$ is $F$-saturated if $H$ does not contain a subgraph isomorphic to $F$, but $H+e$ does for any hyperedge $e\not\in E(H)$. The saturation number of $F$, denoted $\mathrm{sat}_k(n,F)$, is…
A graph $G$ is called $C_k$-saturated if $G$ is $C_k$-free but $G+e$ not for any $e\in E(\overline{G})$. The saturation number of $C_k$, denoted $sat(n,C_k)$, is the minimum number of edges in a $C_k$-saturated graph on $n$ vertices.…
We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…
We consider the low rank matrix completion problem over finite fields. This problem has been extensively studied in the domain of real/complex numbers, however, to the best of authors' knowledge, there exists merely one efficient algorithm…
The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard,…