BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240920T120000
DTEND;TZID=America/New_York:20240920T130000
DTSTAMP:20260629T193901
CREATED:20240907T183145Z
LAST-MODIFIED:20240916T164559Z
UID:10003462-1726833600-1726837200@cmsa.fas.harvard.edu
SUMMARY:Communication Complexity of Combinatorial Auctions
DESCRIPTION:Member Seminar \nSpeaker: Tomer Ezra (CMSA) \nTitle: Communication Complexity of Combinatorial Auctions \nAbstract: We study the communication complexity of welfare maximization in combinatorial auctions with m items and two subadditive bidders. A 2-approximation can be guaranteed by a trivial randomized protocol with zero communication\, or a trivial deterministic protocol with O(1) communication. We show that outperforming these trivial protocols requires exponential communication\, settling an open question of [DobzinskiNS10\, Feige09]. \nSpecifically\, we show that any (randomized) protocol guaranteeing a o(logm)-approximation requires communication exponential in m. We complement it by presenting an O(logm)-approximation in poly(m) communication.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-92024/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Member-Seminar-09.20.24.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240920T140000
DTEND;TZID=America/New_York:20240920T153000
DTSTAMP:20260629T193901
CREATED:20240907T191849Z
LAST-MODIFIED:20240918T134041Z
UID:10003467-1726840800-1726846200@cmsa.fas.harvard.edu
SUMMARY:Classification and Construction of crystalline topological superconductors and insulators in interacting fermion systems
DESCRIPTION:Quantum Matter Seminar \nSpeaker: Zhengcheng Gu\, Chinese University of Hong Kong \nTitle: Classification and construction of crystalline topological superconductors and insulators in interacting fermion systems \nAbstract: The construction and classification of crystalline symmetry protected topological (SPT) phases in interacting bosonic and fermionic systems have been intensively studied in the past few years. Crystalline SPT phases are not only of conceptual importance\, but also provide us great opportunities towards experimental realization since space group symmetries naturally exist for any realistic material. In this talk\, I will discuss how to construct and classify crystalline topological superconductors (TSC) and topological insulators (TI) in interacting fermion systems. I will also discuss the relationship between internal symmetry protected SPT phases and crystalline symmetry protected SPT Phases.
URL:https://cmsa.fas.harvard.edu/event/qm_92024/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Quantum Field Theory and Physical Mathematics,Quantum Matter
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-QMMP-09.20.2024.png
END:VEVENT
END:VCALENDAR