Permutations, multicolored partitions and Feynman diagrams

Combinatorics/Partitions Seminar

Meeting Details

For more information about this meeting, contact Matthew Katz, James Sellers, George Andrews.

Speaker: Adrian Ocneanu, PSU

Abstract: 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.


Room Reservation Information

Room Number: 106 McAllister

Date: 11/12/2013

Time: 10:10am - 11:00am