On 21.10.2010 at 12:20 in S11, there is the following noon lecture:
Matroids represented by entropies
A matroid is partition representable if its rank function corresponds to the collection of Shannon entropies of all subvectors of a random vector. A matroid is asymptotically entropic if its rank function is a limit of such collections. Results on and open problems related to these two classes of matroids will be reviewed. Connections to almost affine codes, ideal secret sharing schemes and entropic regions, studied in information theory, will be outlined.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010