June Huh: Combinatorics and Algebraic Geometry
Counting Colorings of a Graph
Consider coloring the vertices of a graph with colors so that no two adjacent vertices share the same color. For example, in a triangle (three nodes connected in a loop), we need at least three colors to complete this task.
Log-Concavity and Matroids
June Huh has worked on log-concavity — a property of sequences where the square of any term is greater than or equal to the product of its neighbors. For instance, in the sequence [1, 4, 6, 4, 1], each number squared is at least as large as the product of its adjacent numbers.
Matroids are mathematical structures that capture ideas of independence found in examples like graphs and linear algebra. Huh, with Karim Adiprasito and Eric Katz, proved log-concavity results for matroids using techniques from Hodge theory — a powerful tool in algebraic geometry.