Joonkyung Lee (이준경) gave a talk at the Discrete Math Seminar on using Lorentzian polynomials to prove a non-trivial upper bound on the number of graph homomorphisms

On December 17, 2024, Joonkyung Lee (이준경) from Yonsei University gave a talk on using Lorentzian polynomials to prove a non-trivial upper bound on the number of graph homomorphisms at the Discrete Math Seminar. The title of his talk was “Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials“.