Related papers: Tight frames and related geometric problems
It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP…
We show that every frame for a Hilbert space H can be written as a (multiple of a) sum of three orthonormal bases for H. A result of N.J. Kalton is included which shows that this is best possible in that: A frame can be represented as a…
We express the vacuum Einstein constraints in terms of differential forms - the forms include one-forms constituting an orthonormal coframe of the spatial metric. We show that if the metric is real-analytic, then the constraints can be…
We present a relation between volumes of certain lower dimensional simplices associated to a full-dimensional primal and polar dual polytope in R^k. We then discuss an application of this relation to a geometric construction of a Colin de…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\f$ in $\hil$ we find necessary and sufficient…
Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…
Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structured problems, these global constants can…
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
This article is concerned with a geometric tool given by a pair of projector operators defined by almost product structures on finite dimensional manifolds, polarized by a distribution of constant rank and also endowed with some geometric…
Iosevich and Senger (2008) showed that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors. In this note, we provide a graph theoretic proof of…
We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…
In information fusion, one is often confronted with the following problem: given a preexisting set of measurements about an unknown quantity, what new measurements should one collect in order to accomplish a given fusion task with optimal…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
In this note, we prove some results related to small perturbations of a frame for a Hilbert space $\mathcal{H}$ in order to have a woven pair for $\mathcal{H}$. Our results complete those known in the literature. In addition we study a…
For the 2D and 3D Virtual Element Methods (VEM), a new approach to improve the conditioning of local and global matrices in the presence of badly-shaped polytopes is proposed. It defines the local projectors and the local degrees of freedom…
The concept of balancedly splittable orthogonal designs is introduced along with a recursive construction. As an application, equiangular tight frames over the real, complex, and quaternions meeting the Delsarte-Goethals-Seidel upper bound…