Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph minus an edge and use the new theorem to derive a class of facets. 1 Preliminaries and Introduction Let G = (V, E) be a simple undirected graph. A set S ⊆ V of pairwise nonadjacent vertices defines a stable set. Let S...

A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our understanding of stable choice functions. In particular, (i) we show that every stable choice function is generated by a unique simple choice function, which never excl...

In this work, we investigate the interval generalized Sylvester matrix equation AXB+ CXD = F and develop some techniques for obtaining outer estimations for the so-called united solution set of this interval system. First, we propose a modified variant of the Krawczyk operator which causes reducing computational complexity to cubic, compared to Kronecker product form. We then propose an iterati...

we present a numerical study of a one-dimensional version of the burridge-knopoff model [16] of n-site chain of spring-blocks with stick-slip dynamics. our numerical analysis and computer simulations lead to a set of different results corresponding to different boundary conditions. it is shown that we can convert a chaotic behaviour system to a highly ordered and periodic behaviour by making on...