Totally positive view of a computer microchip

Alex Postnikov

UC Berkeley

April 11,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

We define semiconductor networks, which serve as a model for computer microchips, and discuss the inverse boundary problem for these networks. Simply speaking, we answer the question: "To which extent and how can we identify a computer microchip by boundary measurements?" Interestingly, the theory of semiconductor networks generalizes (and simplifies) the recent results of Berenstein, Fomin, and Zelevinsky on totally positive matrices and double Bruhat cells. Let us say that a matroid on an ordered set is totally positive if it can be represented by a real k x n matrix with nonnegative maximal minors. The combinatorial classes of semiconductor networks are in one-to-one correspondence with totally positive matroids. A byproduct of our theory is the complete combinatorial description of totally positive matroids.


Speaker's Contact Info: apost(at-sign)math.berkeley.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on March 30, 2001 at 03:48 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.