2000 character limit reached
A category for bijective combinatorics
Published 21 Jul 2019 in math.CO, math.CT, and math.HO | (1907.09015v1)
Abstract: The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the involution principle of Garsia and Milne, which reveals itself to have little to do with involutions.
Paper Prompts
Sign up for free to create and run prompts on this paper.