An irreversible k-threshold process is a process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set is a subset S of vertices of a graph G such that the irreversible k-threshold process changes all vertices of G to black if S is the initial set of black vertices. We show that deciding the existence of an irreversi...

We give a multidimensional generalisation of the complete set of Bell-correlation inequalities given by Werner and Wolf in [31], and by Ẑukowski and Brukner in [32], for the two-dimensional case. Our construction applies for the n parties, two-observables case, where each observable is d-valued. The d n inequalities obtained involve homogeneous polynomials. They define the facets of a polytope ...