Related papers: A note on scalable frames

Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of…

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…

Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

This paper considers the problem of clustering a partially observed unweighted graph---i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know…

The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…

We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

We give an elementary proof of the fact that any orientable 3-manifold admits a framing (i.e. is parallelizable) and any non-orientable 3-manifold admits a projective framing. The proof uses only basic facts about immersions of surfaces in…

We consider the problem of classification of an object given multiple observations that possibly include different transformations. The possible transformations of the object generally span a low-dimensional manifold in the original signal…

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…

This paper presents an algorithmic framework for the minimization of strictly convex quadratic functions. The framework is flexible and generic. At every iteration the search direction is a linear combination of the negative gradient, as…

We answer a number of open problems in frame theory concerning the decomposition of frames into linearly independent and/or spanning sets. We prove that in finite dimensional Hilbert spaces, Parseval frames with norms bounded away from 1…