相关论文: Saturation of multidimensional 0-1 matrices

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

The article concerns low-rank approximation of matrices generated by sampling a smooth function of two $m$-dimensional variables. We identify several misconceptions surrounding a claim that, for a specific class of analytic functions, such…

We call a family $\mathcal{F}$ of subsets of $[n]$ $s$-saturated if it contains no $s$ pairwise disjoint sets, and moreover no set can be added to $\mathcal{F}$ while preserving this property (here $[n] = \{1,\ldots,n\}$). More than 40…

We study the role of the constraint set in determining the solution to low-rank, positive semidefinite (PSD) matrix sensing problems. The setting we consider involves rank-one sensing matrices: In particular, given a set of rank-one…

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

Positive real odd matrix functions, often referred to as positive real lossless matrix functions, play an important role in many applications in multi-port electrical systems. In this paper we present closer analogues to some of the known…

Consider the matrix power function X^p defined over the cone of positive definite matrices S^{n}_{++}. It is known that X^p is convex over S^{n}_{++} if p is in [-1,0] or [1,2] and X^p is concave over S^{n}_{++} if p is in [0,1]. We show…

We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix $M^*$. Instead of observing a subset of the noisy continuous-valued entries of a matrix $M^*$, we observe a subset of…

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…

Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

We analyze certain compositions of rational inner functions in the unit polydisk $\mathbb{D}^{d}$ with polydegree $(n,1)$, $n\in \mathbb{N}^{d-1}$, and isolated singularities in $\mathbb{T}^d$. Provided an irreducibility condition is met,…

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…

Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…

For an $n$-by-$n$ complex matrix $A$, we define its zero-dilation index $d(A)$ as the largest size of a zero matrix which can be dilated to $A$. This is the same as the maximum $k$ ($\ge 1$) for which 0 is in the rank-$k$ numerical range of…

We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time…

Different commutative semigroups may have a common saturation. We consider distinguishing semigroups with a common saturation based on their ``sparsity''. We propose to qualitatively describe sparsity of a semigroup by considering which…

Let $\mathcal{M}$ be a smooth $d$-dimensional submanifold of $\mathbb{R}^N$ with boundary that's equipped with the Euclidean (chordal) metric, and choose $m \leq N$. In this paper we consider the probability that a random matrix $A \in…

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 describe all linear operators which maps $n-1$-dimensional simplex of idempotent measures to itself. Such operators divided to two classes: the first class contains all $n\times n$-matrices with non-negative entries which has at least…