We describe a new tree decomposition of permutations. The nodes of the tree are called primitive permutations, and their generating function involves imaginary gaussians. An algorithm pairs them with 2-connected fermionic Feynman diagrams, describing electrons and photons in quantum field theory. The combinatorics is based on multicolored partitions, for which we find Eulerian type recursions.