during the last 20 years, it was realized that certain combinatorial objects (combinatorial hopf algebras, to be precise) underly many mathematical theories. the talk will survey some of these developments, and then focus largely on two of the most emblematic and universal such objects, namely the higher algebraic structures that can be constructed out of permutations, and out of surjections. the link is made through the notion of special poset (equivalent to labelled poset of stanley): linear extensions of a poset can be seen as bijections, while the generating function of a poset p with respect to stanley's classical definition of p-partitions associated to a special poset is a quasi-symmetric: in fact, it is a homomorphism between the hopf algebra of labelled posets and that of quasi-symmetric functions; while linearisation is a homomorphism onto the hopf algebra of permutations. the aim is to generalize this frame to preorders, which are in one-to-one correspondence with finite topologies: the objects corresponding to bijections are surjections: they can be seen as linear extensions of a preorder and are encoded by packed words. we can hence define the notion of t-partitions associated to a finite topology t, and deduce a hopf algebra morphism from a new hopf algebra on topologies to the hopf algebra of packed words. this is joint work with l. foissy and f. patras.