相关论文: The compression theorem I

We construct positive-genus analogues of Welschinger's invariants for many real symplectic manifolds, including the odd-dimensional projective spaces and the renowned quintic threefold. In some cases, our invariants provide lower bounds for…

We consider isometric immersions of complete connected Riemannian manifolds into space forms of nonzero constant curvature. We prove that if such an immersion is compact and has semi-definite second fundamental form, then it is an embedding…

A proof of the isometric embedding of a given two-metric in E^3 of class C^1. The method uses the theory of first order partial differential equations. The curvature of the metric plays no role in the proof.

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…

We consider sequences of metrics, $g_j$, on a Riemannian manifold, $M$, which converge smoothly on compact sets away from a singular set $S\subset M$, to a metric, $g_\infty$, on $M\setminus S$. We prove theorems which describe when…

The central idea of the proof is to show that a minimal flow v on a compact 3-manifold M implies the existence of a codimension one foliation F on it, which is transverse to the flow. If M is the 3-sphere, Novikov's theorem applies to show…

We prove the following conjecture due to Bryant Mathews (2008). Let Q be the orthogonal grassmannian of totally isotropic i-planes of a non-degenerate quadratic form q over an arbitrary field (where i is an integer in the interval [1, (\dim…

We show that the problem whether a given finite metric space can be embedded into $m$-dimensional rectilinear space can be reformulated in terms of the Gromov--Hausdorff distance between some special finite metric spaces.

The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

We consider the embedding theory, the approach to gravity proposed by Regge and Teitelboim, in which 4D space-time is treated as a surface in high-dimensional flat ambient space. In its general form, which does not contain artificially…

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…

We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…

We give streamlined proofs of theorems of S.\ Smirnov about the decomposition of vector fields of measures into curves.

In his ``Four Lectures", Gromov conjectured a scalar curvature extremality property of convex polytopes. Moreover, Gromov outlined a proof of the conjecture in the special case when the dihedral angles are acute. Gromov's argument relies on…

Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…

We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…

We improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. 1) In compressed sensing, we show that if the m \times n sensing matrix has…

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…