نتایج جستجو برای: bounded approximate character contractibility
تعداد نتایج: 206651 فیلتر نتایج به سال:
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved, and fit naturally within constraint logic programming. However, in general, filtering that is sound for a global constraint can be unso...
Approximate amenability of Schatten classes, Lipschitz algebras and second duals of Fourier algebras
Amenability of any of the algebras described in the title is known to force them to be finite-dimensional. The analogous problems for approximate amenability have been open for some years now. In this article we give a complete solution for the first two classes, using a new criterion for showing that certain Banach algebras without bounded approximate identities cannot be approximately amenabl...
Consider the following relaxation of the Hadwiger Conjecture: For each t there exists Nt such that every graph with no Kt minor admits a vertex partition into dαt + βe parts, such that each component of the subgraph induced by each part has at most Nt vertices. The Hadwiger Conjecture corresponds to the case α = 1, β = −1 and Nt = 1. Kawarabayashi and Mohar [K. Kawarabayashi, B. Mohar, A relaxe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید