All Questions
1 question
8
votes
1
answer
421
views
p-adic versions of log concavity for graphs (or matroids)
It was recently shown using techniques inspired by algebraic geometry (by Huh and Adiprasito-Huh-Katz) that the chromatic polynomial of a graph (or matroid) has coefficients that satisfy log-concavity....