Inequalities for trees and matroids
Federico Ardila-Mantilla, San Francisco State University
Abstract: In their 1971 study of telephone switching circuitry, Graham and Pollak designed a novel addressing scheme that was better suited for the faster communication required by computers. They introduced the distance matrix of a graph, and used its eigenvalues to bound the size of the addresses in their scheme. We continue their investigation, obtaining more precise spectral information about tree distance matrices. As a consequence, we obtain new inequalities for trees, matroids, and valuated matroids.
This is joint work with Graham Denham, Chris Eur, June Huh, and Botong Wang.
Tea and refreshments available at 4:00 p.m. in the Assmus Conference Room (CU 212).
