A subset of integers is free if for every two distinct subsets we have Pisier asked if for every subset of integers the following two statement are equivalent:
(i) is a union of finitely many free sets.
(ii) There exists such that every finite subset contains a free subset with .
In a more general framework, the Pisier question can be seen as the problem of determining if statements (i) and (ii) are equivalent for subsets of a given structure with prescribed property. We study the problem for several structures including -sets, arithmetic progressions, independent sets in hypergraphs and configurations in the euclidean space. This is joint work with Jaroslav Nešetřil and Vojtech Rödl.