3 papers
cs.DM2022
Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
Jin-Yi Cai, Ben Young
Recently, Mančinska and Roberson proved that two graphs and are quantum isomorphic if and only if they admit the same number of homomorphisms from all planar graphs. We ex…
cs.DM2022
Equality on all #CSP Instances Yields Constraint Function Isomorphism via Interpolation and Intertwiners
Ben Young
A fundamental result in the study of graph homomorphisms is Lovász's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every gr…
math.CO2015
Intersection cohomology of the symmetric reciprocal plane
Nicholas Proudfoot, Max Wakefield, Benjamin Young
We compute the Kazhdan-Lusztig polynomial of the uniform matroid of rank n-1 on n elements by proving that the i-th coefficient of is equal to the number of ways to choose i non-in…