The structure of the soliton cellular automaton is studied by means of
combinatorial techniques. It is shown that the shape of the Young tab
leaux gives an infinite number of time invariants of the automaton. Th
e employed combinatorial materials are the Dyck language, stack repres
entable sequences and the Robinson-Schensted algorithm.