BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220215T090000
DTEND;TZID=America/New_York:20220215T100000
DTSTAMP:20260728T212225
CREATED:20240213T104814Z
LAST-MODIFIED:20240304T100739Z
UID:10002456-1644915600-1644919200@cmsa.fas.harvard.edu
SUMMARY:Equiangular lines and regular graphs
DESCRIPTION:Abstract: In 1973\, Lemmens and Seidel asked to determine N_alpha(r)\, the maximum number of equiangular lines in R^r with common angle arccos(alpha). Recently\, this problem has been almost completely settled when r is exponentially large relative to 1/alpha\, with the approach both relying on Ramsey’s theorem\, as well as being limited by it. In this talk\, we will show how orthogonal projections of matrices with respect to the Frobenius inner product can be used to overcome this limitation\, thereby obtaining significantly improved upper bounds on N_alpha(r) when r is polynomial in 1/alpha. In particular\, our results imply that N_alpha(r) = Theta(r) for alpha >= Omega(1 / r^1/5). \nOur projection method generalizes to complex equiangular lines in C^r\, which may be of independent interest in quantum theory. Applying this method also allows us to obtain\nthe first universal bound on the maximum number of complex equiangular lines in C^r with common Hermitian angle arccos(alpha)\, an extension of the Alon-Boppana theorem to dense regular graphs\, which is tight for strongly regular graphs corresponding to r(r+1)/2 equiangular lines in R^r\, an improvement to Welch’s bound in coding theory.
URL:https://cmsa.fas.harvard.edu/event/2-15-2022-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
END:VCALENDAR