Topological pressures for𝜖-stable and stable sets
نویسندگان
چکیده
منابع مشابه
Stable Algebraic Topology and Stable Topological Algebra
Algebraic topology is a young subject, and its foundations are not yet firmly in place. I shall give some history, examples, and modern developments in that part of the subject called stable algebraic topology, or stable homotopy theory. This is by far the most calculationally accessible part of algebraic topology, although it is also the least intuitively grounded in visualizable geometric obj...
متن کاملStable sets and polynomials
Several applications of methods from non-linear algebra to the stable set problem in graphs are surveyed. The most recent work sketched is joint with A. Schrijver and involves non-linear inequalities. These yield a procedure to generate facets of the stable set polytope. If a class of graphs has the property that all facets of the stable set polytope can be generated this way in a bounded numbe...
متن کاملEpistemically Stable Strategy Sets
This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.
متن کاملStable multi-sets
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets. For the stable multi-set problem, we derive reduction rules and study the associ...
متن کاملII. Stable sets and colourings
We have seen that in any graph G = (V,E), a maximum-size matching can be found in polynomial time. This means that α(L(G)) can be found in polynomial time, where L(G) is the line graph of G.2 On the other hand, it is NP-complete to find a maximum-size stable set in a graph. That is, determining α(G) is NP-complete. Since α(G) = |V |−τ(G) and α(G) = ω(G), also determining the vertex cover number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2013
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2013.263.117