Related papers: Realizability of Polytopes as a Low Rank Matrix Co…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a…
This article mainly aims to give combinatorial characterizations and topological descriptions of quasitoric manifolds with string property. We provide a necessary and sufficient condition for a simple polytope in dimension 2 and 3 to be…
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…
A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…
The essential matrix incorporates relative rotation and translation parameters of two calibrated cameras. The well-known algebraic characterization of essential matrices, i.e. necessary and sufficient conditions under which an arbitrary…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
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…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
The low-rank matrix completion problem can be succinctly stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. While several low-complexity algorithms for matrix completion…
Let $X$ be a compact Riemann surface. A quadratic pair on $X$ consists of a holomorphic vector bundle with a quadratic form which takes values in fixed line bundle. We show that the moduli spaces of quadratic pairs of rank 2 are connected…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
Multivalued projections are applied to the study of weighted least squares solutions of linear relations equations (or inclusions) and some of its applications. To this end a matrix representation of multivalued projections with respect to…
For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…