相关论文: Recipes for stable linear embeddings from Hilbert …

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

Let p be a fibration over a finite simplicial complex, whose fibers have the homotopy type of finite simplicial complexes. Then p is equivalent to an approximate fibration whose total space is a compact ENR. The proof uses homotopy coherent…

In the context of sketching for compressive mixture modeling, we revisit existing proofs of the Restricted Isometry Property of sketching operators with respect to certain mixtures models. After examining the shortcomings of existing…

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to…

We examine critically the Gambier equation and show that it is the generic linearisable equation containing, as reductions, all the second-order equations which are integrable through linearisation. We then introduce the general discrete…

There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matrix and then uses linear programming to decode information…

Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…

For any twisted ideal polygon in $\mathbb{H}^3$, we construct a harmonic map from $\mathbb{C}$ to $\mathbb{H}^3$ with a polynomial Hopf differential, that is asymptotic to the given polygon, and is a bounded distance from a pleated plane.…

A Reeb space is defined as the space of all the connected components of inverse images of a smooth map, which is a fundamental tool in studying smooth manifolds using generic smooth maps whose codimensions are not positive such as Morse…

We give necessary and sufficient conditions on a smooth local map of a Riemannian manifold $M^m$ into the sphere $S^m$ to be the Gauss map of an isometric immersion $u:M^m \to R^n$, $n=m+1$. We briefly discuss the case of general $n$ as…

We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP…

Information theoretical measures, such as entropy, mutual information, and various divergences, exhibit robust characteristics in image registration applications. However, the estimation of these quantities is computationally intensive in…

We develop a Hilbert space framework for a number of general multi-scale problems from dynamics. The aim is to identify a spectral theory for a class of systems based on iterations of a non-invertible endomorphism. We are motivated by the…

Linear programming (LP) is an extremely useful tool which has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such…

This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…

Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…

This article presents general procedures for constructing, estimating, and testing Hilbert space multi-dimensional (HSM) models, which are based on quantum probability theory. HSM models can be applied to collections of K different…

This paper describes an approach for fitting an immersed submanifold of a finite-dimensional Euclidean space to random samples. The reconstruction mapping from the ambient space to the desired submanifold is implemented as a composition of…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

If a continuous map f: X->Q is approximable arbitrary closely by embeddings X->Q, can some embedding be taken onto f by a pseudo-isotopy? This question, called Isotopic Realization Problem, was raised by Shchepin and Akhmet'ev. We consider…