Inequalities for Trees and Matroids

Explore a mathematical colloquium talk that delves into the study of distance matrices in trees and their applications to telephone switching circuitry. Learn how Graham and Pollak's 1971 research on addressing schemes for computer communications led to innovative uses of graph eigenvalues. Discover new inequalities for trees, matroids, and valuated matroids through an examination of spectral properties of distance matrices. Follow along as the speaker presents joint research findings with Graham Denham, Chris Eur, June Huh, and Botong Wang, offering fresh insights into these fundamental mathematical structures and their practical applications in network design.