Related papers: Saturation of 0-1 Matrices
In this paper, we fully characterize the duality mapping over the space of matrices that are equipped with Schatten norms. Our approach is based on the analysis of the saturation of the H\"older inequality for Schatten norms. We prove in…
We consider the problem of comparison-sorting an $n$-permutation $S$ that avoids some $k$-permutation $\pi$. Chalermsook, Goswami, Kozma, Mehlhorn, and Saranurak prove that when $S$ is sorted by inserting the elements into the GreedyFuture…
It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…
Matrix completion is a modern missing data problem where both the missing structure and the underlying parameter are high dimensional. Although missing structure is a key component to any missing data problems, existing matrix completion…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
A graph $H$ is said to be $F$-saturated relative to $G$, if $H$ does not contain any copy of $F$, but the addition of any edge $e$ in $E(G)\backslash E(H)$ would create a copy of $F$. The minimum size of an $F$-saturated graph relative to…
A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known…
In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…
Let ${\cal A}=\{A_1,\ldots, A_r\}$ be a partition of a set $\{1,\ldots,m\}\times\{1,\ldots, n\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\times n$ matrix. We say that $A$ has a pattern ${\cal A}$ provided that $a_{ij}=a_{i'j'}$…
The saturation number $\text{sat}_r(n,\mathcal{F})$ is the minimum number of hyperedges in an $r$-uniform $\mathcal{F}$-saturated hypergraph on $n$ vertices. We determine this parameter for $3$-uniform Berge-$K_4$ hypergraphs, proving that…
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion…
In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-analysis task for these datasets is matrix completion, where the…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
A $(0,1)$-matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)$-matrix is nested if it has the consecutive ones property…
In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…
The flavour neutrino puzzle is often addressed by considering neutrino mass matrices $m$ with a certain number of vanishing entries ($m_{ij}=0$ for some values of the indices), since a reduction in the number of free parameters increases…
The theory of forbidden 0-1 matrices generalizes Turan-style (bipartite) subgraph avoidance, Davenport-Schinzel theory, and Zarankiewicz-type problems, and has been influential in many areas, such as discrete and computational geometry, the…
The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of…