BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20170827T060231Z
DTSTART;TZID=America/Los_Angeles:20170831T161000
DTEND;TZID=America/Los_Angeles:20170831T170000
TRANSP:OPAQUE
SUMMARY:Mathematics Department Colloquium: Boolean representations of simplicial complexes: beyond matroids
UID:111068-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:60 Evans Hall
DESCRIPTION:John Rhodes\, UC Berkeley\n\nWe present a "crash course" on representing finite simplicial complexes by rectangular matrices with coefficients 0 or 1 (Boolean matrices). Our "course" may be of interest to combinatorialists\, topologists\, and discrete geometers and is intended to be accessible to students\, including advanced undergraduates.\n\nOur main theme is a new idea: some of the columns of a Boolean matrix are "linearly independent" (stemming from Tropical Algebra\, which will clearly be explained). The simplicial complex of all such "linearly independent" columns of a fixed Boolean matrix is termed a Boolean representable simplicial complex (BRSC).\n\nThe Boolean representable simplicial complexes include all matroids\, but not all simplicial complexes. We will reformulate the concept of BRSC's using finite lattices\, closure operators\, and Galois connections.\n\nGeneralizing the case of matroids\, we will then explain why BRSC and matroids all come from (combinatorial) geometry. Intuitively\, the BRSC form the largest class of finite simplicial complexes coming from any combinatorial geometry.\n\nTime permitting\, we will explain the deep connections between BRSC and Design Theory\, using the great theorem of R. M. Wilson of the 1970s on the existence of pairwise balanced designs (PBD) and their relation to subgeometries of BRSC.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=111068&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20170827T060231Z
LAST-MODIFIED:20170827T060504Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR