A direct combinatorial construction of symmetric group representations, avoiding a priori use of external concepts (such as Young tableaux), is presented. The construction leads to the study of old and new combinatorial structures; e.g., distinguished intervals in Bruhat posets, shuffles and induction, generalized Young forms and convexity in Cayley graphs. (This is joint work with Ron Adin and Francesco Brenti)