Related papers: Note on half-cube embeddings
This note is about a little extension of Nash's embedding theorem in the case of complete manifolds.
We give some results on quadratic normality of reducible curves canonically embedded and partially extend this study to their projective normality.
Motivated by the large ammount of results obtained for minimal and positive constant mean curvature surfaces in several ambient spaces, the aim of this paper is to obtain half-space theorems for properly immersed surfaces in $\mathbb{R}^3$…
We survey what is known about minimal surfaces in $\bold R^3 $ that are complete, embedded, and have finite total curvature. The only classically known examples of such surfaces were the plane and the catenoid. The discovery by Costa, early…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
We prove the existence of embedded closed constant curvature curves on convex surfaces.
We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a hypercube or a half-hypercube. Example of obtained…
Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…
We consider constructions of covering-radius-1 completely regular codes, or, equivalently, equitable 2-partitions (regular 2-partitions, perfect 2-colorings), of halved n-cubes. Keywords: completely regular code, equitable partition,…
It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…
A short intrinsic proof is given for the Bourgain-Brezis-Mironescu theorem with an extension for higher-order gradient forms. This argument illustrates the role of functional geometry and Fourier analysis for obtaining embedding estimates.…
Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…
We prove that all cubulated groups are semistable at infinity. In doing so we prove two further results about cubulations of groups. The first of these states that any one-ended cubulated group has a cubulation for which all halfspaces are…
While the general question of whether every closed embedding of an affine line in affine $3$-space can be rectified remains open, there have been several partial results proved by several different means. We provide a new approach, namely…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
We give the first fully polynomial-time algorithm for learning halfspaces with respect to the uniform distribution on the hypercube in the presence of contamination, where an adversary may corrupt some fraction of examples and labels…
The purpose of this article is to introduce for dispersive partial differential equations with random initial data, the notion of well-posedness (in the Hadamard-probabilistic sense). We restrict the study to one of the simplest examples of…
We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\mathcal{T}\subseteq\mathbb{R}^n$ into binary sequences in the cube $\{\pm 1\}^m$. When $\mathcal{T}$ consists of well-spread (i.e.,…
We introduce a diagrammatic multi-scale approach to the Hubbard model based on the interaction-irreducible (multi-boson) vertex of a small cluster embedded in a self-consistent medium. The vertex captures short-ranged correlations up to the…