Results 281 to 290 of about 624,674 (321)

Embedded optimal control problems

IEEE Conference on Decision and Control and European Control Conference, 2011
In this paper we define a class of optimal control problems which we denote “embedded optimal control problems”. These are not true optimal control problems since the control system is not locally controllable on the manifold on which it is defined.
Nikolaj Nordkvist, Peter E. Crouch, Anthony M. Bloch, Amit K. Sanyal   +3 more
openaire   +1 more source

Abhyankars Conjecture and embedding problems

Journal für die reine und angewandte Mathematik (Crelles Journal), 2003
Let \(U\) be a smooth connected affine curve over an algebraically closed field \(k\) of characteristic \(p>0\). An explicit description of the set of finite quotients of the étale fundamental group \(\pi_1(U)\) was conjectured in 1957 by Abhyankar, and proved by \textit{M. Raynaud} [Invent. Math.
openaire   +2 more sources

COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM

The Bulletin of Symbolic Logic, 2016
AbstractThe Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.
Goldbring, Isaac, Hart, Bradd
openaire   +2 more sources

The Embedding Problem

1987
After the discovery quantum mechanics, the opinion arose that quantum mechanics is a more comprehensive theory than “classical” mechanics (for a more exact formulation of a “more comprehensive theory” se XIII §3, [3] §8, and [48]).
openaire   +1 more source

Embedded Model Problem

2017
AbstractThis chapter introduces embedded models. This is a special case of a parametric model which cannot be obtained simply by setting the parameters to particular values in a simple way. An example is the regression function y = b[1−exp(−ax)], which is always curved when a and b have fixed values.
openaire   +1 more source

Solution to König's Graph Embedding Problem

Mathematische Nachrichten, 1989
Perhaps the most celebrated theorem in graph theory is due to Kuratowski: a graph is planar if and only if it does not contain a subdivision of \(K_ 5\) or of \(K_{3,3}\). In 1936 D. König asked if one could find similar ``forbidden subgraphs'' characterizing embeddability on other surfaces.
Bodendiek, R., Wagner, Klaus
openaire   +1 more source

The Cycle Embedding Problem

2016
Given two hypergraphs, representing a fine and a coarse “layer”, and a cycle cover of the nodes of the coarse layer, the cycle embedding problem (CEP) asks for an embedding of the coarse cycles into the fine layer. The CEP is NP-hard for general hypergraphs, but it can be solved in polynomial time for graphs.
Ralf Borndörfer, Marika Karbstein, Julika Mehrgardt, Markus Reuther, Thomas Schlechte   +4 more
openaire   +1 more source

Co-amenability and Connes’s embedding problem

Science China Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Embedding and Mapping Problems

2012
Embedding problems in discrete geometry lead to very challenging and interesting questions. A very basic question is whether a given graph G is planar, i.e., can be drawn in the plane such that edges do not cross. Kuratowski’s theorem, Theorem A.18, answers this question in terms of forbidden subgraphs.
openaire   +1 more source

THE EMBEDDING PROBLEM WITH GIVEN LOCALIZATIONS

Mathematics of the USSR-Izvestiya, 1975
In this paper we find necessary and sufficient conditions, stated in cohomological terms, for the existence of a solution to the numerical abelian imbedding problem with given local behavior for a finite set of prime points.Bibliography: 6 items.
openaire   +2 more sources