Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Connes embedding problem (view)

searching for Embedding problem 21 found (32 total)

Skorokhod's embedding theorem (285 words) [view diff] no match in snippet view article find links to article

In mathematics and probability theory, Skorokhod's embedding theorem is either or both of two theorems that allow one to regard any suitable collection

Topological graph theory (565 words) [view diff] exact match in snippet view article find links to article

surface, a sphere for example, without two edges intersecting. A basic embedding problem often presented as a mathematical puzzle is the three utilities problem

Erhard Heinz (240 words) [view diff] exact match in snippet view article find links to article

prescribed mean curvature, in particular of minimal surfaces, for the Weyl embedding problem, and for systems of Monge-Ampère type. In 1994 he was awarded the

Paul C. Yang (381 words) [view diff] exact match in snippet view article find links to article

and Q-curvature. In CR Geometry he is known for his work on the CR embedding problem, the CR Paneitz operator and for introducing the Q' curvature in CR

Post correspondence problem (2,521 words) [view diff] case mismatch in snippet view article find links to article

Correspondence Problem), the problem becomes undecidable again. The Post Embedding Problem is another variant where one looks for indexes i 1 , i 2 , … {\displaystyle

Tsirelson's bound (2,153 words) [view diff] exact match in snippet view article find links to article

shown to be equivalent to Connes' embedding problem, so the same proof also implies that the Connes embedding problem is false. Quantum nonlocality Bell's

Curvilinear principle (845 words) [view diff] exact match in snippet view article find links to article

response to an important question in sociolinguistics known as the embedding problem, a problem "concerned with determining regular patterns in both the

Masatake Kuranishi (929 words) [view diff] exact match in snippet view article find links to article

compact complex manifolds. In 1982 he made important progress in the embedding problem for CR manifolds (Cauchy–Riemann structures). In a series of deep

Nash–Moser theorem (3,786 words) [view diff] exact match in snippet view article find links to article

(1956), who proved the theorem in the special case of the isometric embedding problem. It is clear from his paper that his method can be generalized. Moser

Universal space (915 words) [view diff] exact match in snippet view article find links to article

Lindenstrauss, Elon; Tsukamoto, Masaki (March 2014). "Mean dimension and an embedding problem: An example". Israel Journal of Mathematics. 199 (2): 573–584. doi:10

John Selfridge (1,583 words) [view diff] exact match in snippet view article find links to article

pp. 299–311. Howie, John M.; Selfridge, J. L. (1991). "A semigroup embedding problem and an arithmetical function". Math. Proc. Camb. Philos. Soc. 109

Non-cognitivism (2,011 words) [view diff] exact match in snippet view article find links to article

aspect is also the basis of its goodness. Another argument is the "embedding problem" in which ethical sentences are embedded into more complex sentences

Embedding (2,687 words) [view diff] exact match in snippet view article find links to article

manifolds, Ann. of Math. (2), 37 (1936), pp. 645–680 Nash J., The embedding problem for Riemannian manifolds, Ann. of Math. (2), 63 (1956), 20–63. Bishop

Carlo Dalla Pozza (1,209 words) [view diff] case mismatch in snippet view article find links to article

81-109) Richard Stuart Anderson, Some Remarks on the Frege-Geach Embedding Problem 2009 Kurt Ranalter, "A Semantic Analysis of a Logic of Assertions

Leroy P. Steele Prize (2,239 words) [view diff] exact match in snippet view article find links to article

(1971), 265-298. 1999 John F. Nash for his remarkable paper: "The embedding problem for Riemannian manifolds," Ann. of Math. (2) 63 (1956) 20-63. 1998

Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article

and since any circle graph can be formed in this way from some book embedding problem, it follows that optimal book embedding is also NP-hard. For a fixed

GNU MathProg (620 words) [view diff] exact match in snippet view article find links to article

AMPL-like syntax for easy model formulation Built-in data section for embedding problem data Compatibility with GLPK for solving and analysis Ability to import

1-planar graph (2,757 words) [view diff] exact match in snippet view article find links to article

Michael; Kaufmann, Michael; Zielke, Christian (2015), "The book embedding problem from a SAT-solving perspective", Proc. 23rd International Symposium

Louis Nirenberg (5,007 words) [view diff] exact match in snippet view article find links to article

wave equations.[BN78a][BN78b] In John Nash's work on the isometric embedding problem, the key step is a small perturbation result, highly reminiscent of

Shing-Tung Yau (10,542 words) [view diff] exact match in snippet view article find links to article

differential identity used in the solution of the Weyl isometric embedding problem.[CY77b] Outside of the setting of submanifold rigidity problems, Yau

Approximate max-flow min-cut theorem (2,264 words) [view diff] exact match in snippet view article find links to article

designing a VLSI circuit. Such a problem can often be modeled as a graph embedding problem. The objective is to find an embedding for which the layout area is