Examples of using An embedding in English and their translations into Russian
{-}
-
Colloquial
-
Official
Then it suffices to show that the map f̄′(see Definition of f̄′)is an embedding.
Equivalently, an embedding is a function that pushes forward the ordering on X: whenever, one has.
The matrix representation given above constitutes an embedding into Dickson's group G24.
Conversely, if an embedding has both of these properties, then it is equivalent to an upward embedding. .
People also translate
The 14 vertices and 21 edges of the Szilassi polyhedron form an embedding of the Heawood graph onto the surface of a torus.
An embedding of a partial cube onto a hypercube of this dimension is unique, up to symmetries of the hypercube.
The seven vertices and 21 edges of the Császár polyhedron form an embedding of the complete graph K 7{\displaystyle K_{7}} onto a topological torus.
An embedding in which edges are at unit distance and non-edges are not at unit distance requires at least n- 2 dimensions.
The boundary segments of the regions of Tietze's subdivision(including the segments along the boundary of the Möbius strip itself) form an embedding of Tietze's graph.
It is so called because such an embedding can be found as the equilibrium position for a system of springs representing the edges of the graph.
Negami(1986) proved, conversely,that if a connected graph H has a two-ply planar cover then H must have an embedding into the projective plane.
The Möbius-Kantor graph admits an embedding into a triple torus(genus 3 torus) that is a regular map having four 12-gonal faces; Marušič& Pisanski 2000.
The unknotting problem has the same computational complexity as testing whether an embedding of an undirected graph in Euclidean space is linkless.
Generally, an injective function f from an unordered set X to a cycle Y induces a unique cyclic order on X that makes f an embedding.
An embedding of a graph into three-dimensional space in which no two of the cycles are topologically linked is called a linkless embedding. .
Additionally, he proved that, with a single exception(the eight-vertex complement graph of the cube)every nearly planar graph has an embedding onto the projective plane.
This labeling defines an embedding of these graphs into a hypercube(the graph of all bitstrings of a given length, with the same adjacency-condition) that turns out to be distance-preserving.
As an important example, if X is a subset of a cyclically ordered set Y, and X is given its natural ordering, then the inclusion map i:X→ Y is an embedding.
It is called the spring theorem because such an embedding can be found as the equilibrium position for a system of springs representing the edges of the graph.
The forbidden minor characterization of linkless graphs leads to a polynomial time algorithm for their recognition, butnot for actually constructing an embedding.
To find such an embedding, one can use the position of a vertex in the first path as its x-coordinate, and the position of the same vertex in the second path as its y-coordinate.
Testing whether a directed graph with a fixed planar embedding can be drawn upward planar, with an embedding consistent with the given one, can be accomplished by checking that the embedding is bimodal and modeling the consistent assignment problem as a network flow problem.
An embedding of the Heawood graph into a torus(shown as a square with periodic boundary conditions) partitioning it into seven mutually-adjacent regions Weisstein, Eric W.
Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints.
If your computer has an embedded Bluetooth wireless adapter, verify that Bluetooth is turned on.
An embedded file downloader helps you distribute your files, programmes or firmware.
This speakerphone has an embedded, non-replaceable battery.
But seven of the phones are certified to run payment on an embedded secure chip.
He gets paid way too much for an embed.