We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers ` ≥ k ≥ 2 and every d > 0 there exists % > 0 for which the following holds: if H is a sufficiently large kuniform hypergra...

By Gromov’s compactness theorem for metric spaces, every uniformly compact sequence of metric spaces admits an isometric embedding into a common compact metric space in which a subsequence converges with respect to the Hausdorff distance. Working in the class or oriented k-dimensional Riemannian manifolds (with boundary) and, more generally, integral currents in metric spaces in the sense of Am...

Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...

in this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (steganography). data is encrypted bytwo methods before embedding to increase reliability. then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

We prove that a generic canonically or bicanonically embedded smooth curve has semistable m Hilbert points for all m ≥ 2. We also prove that a generic bicanonically embedded smooth curve has stable m Hilbert points for all m ≥ 3. In the canonical case, this is accomplished by proving finite Hilbert semistability of special singular curves with Gm-action, namely the canonically embedded balanced...

The only connected minimal surfaces foliated by circles and lines are domains on one of the following surfaces: the helicoid, the catenoid, the plane, and the examples of Riemann ([Ri] p329-33, [En] p403-6, [Ni] p85-6). All these surfaces are complete and embedded. Topologically they are planar domains: the helicoid is simply-connected, the catenoid is an annulus (conformally a twice-punctured ...

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary N distinct points in S, our goal is to encode each point using mdimensional binary strings such that we can reconstruct their geodesic distance up to δ uniform distortion. Existing bina...

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes weak equivalences, special cases appropriate for the respective Lipschitz settings. Cubical additional compatible structures categories (co)fibrant objects. A categorical equivalence between lifts to full faithful embedding from an associated catego...