Equivalence classes of permutations modulo excedances

We introduce a new equivalence relation on permutations where two permutations are equivalent if and only if they coincide on their excedance sets. This paper studies equivalence classes for several subsets of permutations. Enumerating results are presented for permutations, cycles and permutations avoiding one or two patterns of length three. Also, an open question is proposed.