In this paper, we introduce new combinatorial objects, the
pseudo-permutations, which are a generalization of the
permutations. Pseudo-permutations naturally appear in various
fields of Computer Science and Mathematics. We provide the
first combinatorial results on these objects: we study the
classical statistics of enumeration, inversions, descents
and we prove that the set of all the pseudo-permutations is a
lattice.
