BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//85f20b73fecb3e0e6ca434791a2aea4a.ias.edu//NONSGML kigkonsult.se i
Calcreator 2.29.29//
CALSCALE:GREGORIAN
UID:ed40e38d-1dd7-4afe-a8d0-4a208a5760b0
X-WR-TIMEZONE:UTC
X-WR-CALNAME:IAS CSDM Seminars
BEGIN:VEVENT
UID:7abaf469-d6a5-46ce-a525-6962e236e1ba
DTSTAMP:20201101T020705Z
CREATED:20151009T131505Z
DESCRIPTION:
DTSTART;TZID=America/New_York:20060206T111500
DTEND;TZID=America/New_York:20060206T121500
LAST-MODIFIED:20201031T171012Z
LOCATION:
SUMMARY:COMPUTER SCIENCE/DISCRETE MATH 1
URL:https://www.ias.edu/events/computer-sciencediscrete-math-1-0
END:VEVENT
BEGIN:VEVENT
UID:acebc06a-2ae5-48f2-b72b-bbb259307462
DTSTAMP:20201101T020705Z
CREATED:20151009T131505Z
DESCRIPTION:
DTSTART;TZID=America/New_York:20300405T023000
DTEND:
LAST-MODIFIED:20201031T171012Z
LOCATION:
SUMMARY:COMPUTER SCIENCE/DISCRETE MATH 1
URL:https://www.ias.edu/events/computer-sciencediscrete-math-1-0
END:VEVENT
BEGIN:VEVENT
UID:aa606017-cb15-4663-8d66-3c0e66d2e39e
DTSTAMP:20201101T020705Z
CREATED:20200916T143659Z
DESCRIPTION:Topic: An introductory survey on expanders and their applicatio
ns\n\nSpeakers: Avi Wigderson\n\nAffiliation: Herbert H. Maass Professor\,
School of Mathematics\n\nVideo: Simonyi Hall 101 and Remote Access - see
Zoom link below\n\nExpander graphs are among the most useful objects in co
mputer science\nand mathematics. They have found applications in numerous
areas of\nboth. I will review their definition\, and explain some of the m
any\napplications. Time permitting\, I will also discuss some of the\ndiff
erent ways of constructing them\, and ask some of my favorite open\nproble
ms regarding them.\n
DTSTART;TZID=America/New_York:20200929T103000
DTEND;TZID=America/New_York:20200929T123000
LAST-MODIFIED:20201001T150415Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-250
END:VEVENT
BEGIN:VEVENT
UID:8ab85666-e0e4-4a70-8f05-beebb1980c27
DTSTAMP:20201101T020705Z
CREATED:20200827T122103Z
DESCRIPTION:Topic: Splitting Necklaces: Existence\, Hardness and Approximat
ion\n\nSpeakers: Noga Alon\n\nAffiliation: Princeton University\n\nVideo:
Simonyi Hall 101 and Remote Access - see Zoom link below\n\nIt is known th
at any opened necklace with beads of n types can be\npartitioned by at mos
t (k-1)n cuts into intervals that can be\ndistributed into k collections\,
each containing the same number of\nbeads of each type (up to 1). The pro
of is topological and provides no\nefficient procedure for finding such cu
ts. In fact\, for k=2 the\nproblem of finding such cuts\, and even an easi
er approximate version\nof it\, are known to be PPA hard.\n\nI will discus
s efficient online and offline algorithms for solving the\nproblem and its
approximate version by increasing the number of cuts\,\nand show that the
number of cuts for the online case is essentially\noptimal. A representat
ive result is an efficient (offline) algorithm\nthat solves the problem fo
r a necklace with n types of beads\, m beads\nof each type and k=2 by maki
ng at most n(log m+2) cuts. The method\nprovides an exponential improvemen
t of a result of Bhatt and Leighton\nfrom the 80s.\n\nJoint work with Andr
ei Graur.\n
DTSTART;TZID=America/New_York:20201005T111500
DTEND;TZID=America/New_York:20201005T121500
LAST-MODIFIED:20201012T225126Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-241
END:VEVENT
BEGIN:VEVENT
UID:cbaae87c-dad7-41c2-a42a-a07be8e56bff
DTSTAMP:20201101T020705Z
CREATED:20200827T125431Z
DESCRIPTION:Topic: Simplified Lifting Theorems in Communication Complexity
via Sunflowers\n\nSpeakers: Toniann Pitassi\n\nAffiliation: University of
Toronto\; Visiting Professor\, School of Mathematics\n\nVideo: Simonyi Hal
l 101 and Remote Access - see Zoom link below\n\nIn this talk I will first
motivate lifting theorems where lower bounds\non communication complexity
for composed functions are obtained by a\ngeneral simulation theorem\, es
sentially showing that no protocol can\ndo any better than the obvious 'qu
ery' algorithm. I'll give a\nself-contained simplified proof of lifting wh
ich uses the sunflower\nlemma. The simplified proof is joint with Shachar
Lovett\, Raghu Meka\,\nIan Mertz\, and Jiapeng Zhang .
DTSTART;TZID=America/New_York:20201006T103000
DTEND;TZID=America/New_York:20201006T123000
LAST-MODIFIED:20201012T224441Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-241
END:VEVENT
BEGIN:VEVENT
UID:956195b5-e7ab-47ff-825c-6c4ee2deab15
DTSTAMP:20201101T020705Z
CREATED:20200827T131347Z
DESCRIPTION:Topic: Explicit near-fully X-Ramanujan graphs\n\nSpeakers: Xiny
u Wu\n\nAffiliation: Carnegie Mellon University\n\nVideo: Simonyi Hall 101
and Remote Access - see Zoom link below\n\nIn this talk I will introduce
constructions of finite graphs which\nresemble some given infinite graph b
oth in terms of their local\nneighborhoods\, and also their spectrum. Thes
e graphs can be thought of\nas expander graphs with local constraints in a
constant-sized\nneighborhood\, and generalize the notion of d-regular Ram
anujan graphs.\n\nFirst\, I will show how a 'recipe' in the form of some\n
matrix-coefficient non-commutative polynomial can be used to specify\nmany
infinite graphs\, including those arising from various graph\nproducts\,
and also generate finite graphs which are covered by the\ninfinite graph.
A recent landmark result of Bordenave and Collins\nimplies that for all su
ch graphs\, with high probability the finite\ngraphs generated with this r
ecipe also have their nontrivial spectrum\nclose to that of the infinite g
raph.\n\nNext\, I will talk about a derandomized form of this result: we p
rovide\na deterministic polynomial-time algorithm which\, for any X which
can\narise from a matrix-coefficient polynomial\, produces arbitrarily lar
ge\ngraphs G that are covered by X and have (nontrivial) spectrum at\nHaus
dorff distance at most eps from that of X.\n\nJoint work with Ryan O'Donne
ll.\n
DTSTART;TZID=America/New_York:20201012T111500
DTEND;TZID=America/New_York:20201012T121500
LAST-MODIFIED:20201012T224927Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-246
END:VEVENT
BEGIN:VEVENT
UID:d480f2b5-7000-4362-bde1-ba794fa5d71b
DTSTAMP:20201101T020705Z
CREATED:20200827T124355Z
DESCRIPTION:Topic: Arithmetic progressions and spectral structure\n\nSpeake
rs: Thomas Bloom\n\nAffiliation: University of Cambridge\n\nHow dense can
a set of integers be while containing no three-term\narithmetic progressio
ns? This is one of the classical problems of\nadditive combinatorics\, and
since the theorem of Roth in 1953 that\nsuch a set must have zero density
\, there has been much quantitative\nprogress in how quickly this density
must decay. \n\nIn the first half of the seminar\, I will give a survey of
the\nquantitative progress on Roth's theorem on three-term arithmetic\npr
ogressions\, culminating in the recent work of myself and Olof\nSisask\, t
hat in particular resolves the first non-trivial case of a\nfamous conject
ure of Erdős: if the sum of reciprocals diverges then A\nmust contain thre
e-term arithmetic progressions. I will give a\nhigh-level overview of the
proof of this new result\, which uses a\nblend of harmonic analysis and el
ementary combinatorial arguments.\n\nIn the second half of the seminar\, I
will discuss in depth one\nimportant component of our new proof: a struct
ural result for\nadditively non-smoothing sets. Roughly speaking\, a set i
s additively\nnon-smoothing when it grows under addition once\, but furthe
r addition\nreveals no extra structure. The first structural result for su
ch sets\nwas proved by Bateman and Katz in their work on the cap set probl
em.\nAn important part of my work with Olof Sisask was to prove a\nstructu
ral result of this kind for arbitrary groups (in particular for\nsubsets o
f the integers). In this talk I will sketch our proof of this\nstructural
result\, which uses only elementary methods\, and which\nshould have many
further applications in other problems of additive\ncombinatorics.\n
DTSTART;TZID=America/New_York:20201013T103000
DTEND;TZID=America/New_York:20201013T123000
LAST-MODIFIED:20201016T124853Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-240
END:VEVENT
BEGIN:VEVENT
UID:fa75da1e-0bd8-4836-829c-75aae63372e9
DTSTAMP:20201101T020705Z
CREATED:20200827T124710Z
DESCRIPTION:Topic: A Parallel Repetition Theorem for the GHZ Game\n\nSpeake
rs: Justin Holmgren\n\nAffiliation: Massachusetts Institute of Technology
\n\nWe prove that parallel repetition of the (3-player) GHZ game reduces\n
the value of the game polynomially fast to 0. That is\, the value of\nthe
GHZ game repeated in parallel t times is at most $t^{-\Omega(1)}.\nPreviou
sly\, only a bound of roughly 1 / alpha(t)\, where alpha is the\ninverse A
ckermann function\, was known.\n\nThe GHZ game was recently identified by
Dinur\, Harsha\, Venkat and Yuen\nas a multi-player game where all existin
g techniques for proving\nstrong bounds on the value of the parallel repet
ition of the game\nfail. Indeed\, to prove our result we use a completely
new proof\ntechnique. Dinur et al. speculated that progress on bounding th
e value\nof the parallel repetition of the GHZ game may lead to further\np
rogress on the general question of parallel repetition of\nmulti-player ga
mes. They suggested that the strong correlations\npresent in the GHZ quest
ion distribution represent the ``hardest\ninstance'' of the multi-player p
arallel repetition problem.\n\nAnother motivation for studying the paralle
l repetition of the GHZ\ngame comes from the field of quantum information.
The GHZ game\, first\nintroduced by Greenberger\, Horne and Zeilinger\, i
s a central game in\nthe study of quantum entanglement and has been studie
d in numerous\nworks. For example\, it is used for testing quantum entangl
ement and\nfor device-independent quantum cryptography. In such applicatio
ns a\ngame is typically repeated to reduce the probability of error\, and
\nhence bounds on the value of the parallel repetition of the game may\nbe
useful.\n
DTSTART;TZID=America/New_York:20201019T111500
DTEND;TZID=America/New_York:20201019T121500
LAST-MODIFIED:20201014T161535Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-242
END:VEVENT
BEGIN:VEVENT
UID:0f632f50-da9a-4d3c-8f0a-7a160a853611
DTSTAMP:20201101T020705Z
CREATED:20200827T131806Z
DESCRIPTION:Topic: The threshold for the square of a Hamilton cycle\n\nSpea
kers: Jinyoung Park\n\nAffiliation: Member\, School of Mathematics\n\nWe w
ill talk about a recent result of Jeff Kahn\, Bhargav Narayanan\,\nand mys
elf stating that the threshold for the random graph G(n\,p) to\ncontain th
e square of a Hamilton cycle is 1/sqrt n\, resolving a\nconjecture of Kühn
and Osthus from 2012. For context\, we will first\nspend some time discus
sing a recent result of Keith Frankston and the\nthree aforementioned auth
ors on a conjecture of Talagrand (a\nfractional version of Kahn-Kalai 'exp
ectation-threshold conjecture').\n
DTSTART;TZID=America/New_York:20201020T103000
DTEND;TZID=America/New_York:20201020T123000
LAST-MODIFIED:20201015T161849Z
LOCATION:Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-245
END:VEVENT
BEGIN:VEVENT
UID:6c5ea13a-9fbb-4de5-bcd2-44e703573da7
DTSTAMP:20201101T020705Z
CREATED:20200827T124824Z
DESCRIPTION:Topic: Fractionally Log-Concave and Sector-Stable Polynomials:
Counting Planar Matchings and More\n\nSpeakers: Nima Anari\n\nAffiliation:
Stanford University\n\nWe introduce two new notions for polynomials assoc
iated with discrete\nset-valued probability distributions. These notions g
eneralize\nwell-studied properties like real-stability and log-concavity\,
but\nunlike them robustly degrade under a number of useful transformation
s\napplied to the polynomial/distribution. We show that these notions\nimp
ly polynomial time approximate sampling and counting algorithms\nthrough r
apid mixing of multi-site Glauber dynamics. We establish the\nnew notions
for polynomials/distributions related to matchings\,\nPfaffian point proce
sses\, and partition-constrained strongly Rayleigh\nmeasures with O(1) par
titions. As the main application we show how to\napproximately count match
ings of a desired size k\, or sample from the\nmonomer-dimer distribution\
, in arbitrary planar graphs (not\nnecessarily bipartite) in polynomial ti
me\; this answers a question\nraised by Jerrum in 1987 who proved intracta
bility of exact counting\nin the planar case. Joint work with Yeganeh Alim
ohammadi\, Kirankumar\nShiragur\, and Thuy-Duong Vuong.
DTSTART;TZID=America/New_York:20201026T111500
DTEND;TZID=America/New_York:20201026T121500
LAST-MODIFIED:20201020T121408Z
LOCATION:Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-243
END:VEVENT
BEGIN:VEVENT
UID:44868b36-b37f-4a37-a021-9ada57573454
DTSTAMP:20201101T020705Z
CREATED:20200827T131715Z
DESCRIPTION:Topic: On the extension complexity of random polytopes\n\nSpeak
ers: Lisa Sauermann\n\nAffiliation: Member\, School of Mathematics\n\nSome
times\, it is possible to represent a complicated polytope as a\nprojectio
n of a much simpler polytope. To quantify this phenomenon\,\nthe extension
complexity of a polytope P is defined to be the minimum\nnumber of facets
in a (possibly higher-dimensional) polytope from\nwhich P can be obtained
as a (linear) projection. In this talk\, I will\nfirst give some backgrou
nd on extension complexity and explain its\nconnection to the notion of no
n-negative rank. I will then discuss\nsome results on the extension comple
xity of random polytopes (which\nare obtained as the convex hull of indepe
ndent random points either in\nthe unit ball or on the unit sphere)\, whic
h are joint work with\nMatthew Kwan and Yufei Zhao. Our results prove that
the extension\ncomplexity of these random polytopes is typically on the o
rder of the\nsquare root of number of vertices of the polytope.\n
DTSTART;TZID=America/New_York:20201027T103000
DTEND;TZID=America/New_York:20201027T123000
LAST-MODIFIED:20201020T141952Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-243
END:VEVENT
BEGIN:VEVENT
UID:5e96c2cd-efb7-4853-9d14-2663a08b8946
DTSTAMP:20201101T020705Z
CREATED:20200827T131416Z
DESCRIPTION:Topic: Anti-concentration and the Gap-Hamming problem\n\nSpeake
rs: Anup Rao\n\nAffiliation: University of Washington\n\nWe prove new lowe
r bounds on the well known Gap-Hamming problem in\ncommunication complexit
y. Our main technical result is an\nanti-concentration bound for the inner
product of two independent\nrandom vectors. We show that if A\, B are arb
itrary subsets of the cube\n{±1}^n with |A| · |B| ≥ 2^(1.01n)\, and X ∈ A
and Y ∈ B are\nsampled independently and uniformly\, then the inner produc
t must\nbe anti-concentrated: it takes on any fixed value with prob
ability at\nmost O(1/sqrt(n)). In fact\, the following stronger claim hold
s: for\nany integer k\, |Pr[=k] - Pr[ = k+4]| is at most O(1/n
).\nRemarkably\, this last claim is false if 4 is replaced with an integer
\nthat is not divisible by 4. I will explain why this happens in my\ntalk.
\n\nThis is joint work with Amir Yehudayoff.\n
DTSTART;TZID=America/New_York:20201102T111500
DTEND;TZID=America/New_York:20201102T121500
LAST-MODIFIED:20201028T153255Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-247
END:VEVENT
BEGIN:VEVENT
UID:5a85ff5d-f37e-469a-af12-85d264e110f7
DTSTAMP:20201101T020705Z
CREATED:20200827T131741Z
DESCRIPTION:Topic: No seminar - Election Day\n\n
DTSTART;TZID=America/New_York:20201103T103000
DTEND;TZID=America/New_York:20201103T123000
LAST-MODIFIED:20201020T132110Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-244
END:VEVENT
BEGIN:VEVENT
UID:b658cbf2-6ead-4b93-8e69-03f38bdb76d6
DTSTAMP:20201101T020705Z
CREATED:20200827T124950Z
DESCRIPTION:Topic: Associativity testing\n\nSpeakers: Ben Green\n\nAffiliat
ion: University of Oxford\n\nSuppose we have a cancellative binary associa
tive operation * on a\nfinite set X. We say that it is delta-associative i
f the proportion of\ntriples x\, y\, z such that x*(y*z) = (x*y)*z is at l
east delta.\n\nGowers and Long studied somewhat associative operations\, a
nd we will\ndescribe their main result. They also suggested an example of
a\nsomewhat associative operation which they conjectured does not (in a\ns
ense I will make precise) resemble a group operation. I will describe\na p
roof of their conjecture\, which uses a surprisingly large number of\ntool
s from additive combinatorics and group theory.\n
DTSTART;TZID=America/New_York:20201109T111500
DTEND;TZID=America/New_York:20201109T121500
LAST-MODIFIED:20201028T153401Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-244
END:VEVENT
BEGIN:VEVENT
UID:475c5835-abc9-4a72-b660-0b15c191ec7d
DTSTAMP:20201101T020705Z
CREATED:20200827T131651Z
DESCRIPTION:Topic: Modular zeros in the character table of the symmetric gr
oup\n\nSpeakers: Sarah Peluse\n\nAffiliation: Member\, School of Mathemati
cs\n\nMiller computed the character table of $S_n$ for some fairly large n
's\nand noticed that almost all of the entries were even. Based on this\,
\nhe conjectured that the proportion of even entries in the character\ntab
le of $S_n$ tends to $1$ as $n\to\infty$. I'll present two proof of\nthis
conjecture\, one of which shows more generally that almost every\nentry of
the character table of $S_n$ is divisible by $p$ for all\nprimes $p$ up t
o $13$. Interestingly\, this proof naturally breaks down\npast $p=13$. I w
ill also discuss the problem of determining the\ndensity of zeros in the c
haracter table of $S_n$. Miller also has\ncomputational data suggesting th
at this density is a positive number\nless than $1$. No background on the
representation theory of $S_n$\nwill be assumed--since the talk is two hou
rs\, I will spend the first\npart introducing this topic.\n
DTSTART;TZID=America/New_York:20201110T103000
DTEND;TZID=America/New_York:20201110T123000
LAST-MODIFIED:20201028T153511Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-242
END:VEVENT
BEGIN:VEVENT
UID:3011fedc-4c52-4286-aab4-f6154c7495a4
DTSTAMP:20201101T020705Z
CREATED:20200827T131434Z
DESCRIPTION:Topic: To Be Announced\n\nSpeakers: Huijia (Rachel) Lin\n\nAffi
liation: University of Washington\n\n
DTSTART;TZID=America/New_York:20201116T111500
DTEND;TZID=America/New_York:20201116T131500
LAST-MODIFIED:20200923T152701Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-248
END:VEVENT
BEGIN:VEVENT
UID:66ad210f-1b74-4278-8a15-099260ccf1f7
DTSTAMP:20201101T020705Z
CREATED:20200827T131829Z
DESCRIPTION:Topic: To Be Announced\n\nSpeakers: Vijay Bhattiprolu\n\nAffili
ation: Member\, School of Mathematics\n\n
DTSTART;TZID=America/New_York:20201117T103000
DTEND;TZID=America/New_York:20201117T123000
LAST-MODIFIED:20201008T155023Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-246
END:VEVENT
BEGIN:VEVENT
UID:8d6e43b8-2a85-4528-99ed-b6b22e422ea5
DTSTAMP:20201101T020705Z
CREATED:20200827T131449Z
DESCRIPTION:Topic: To Be Announced\n\nSpeakers: Amir Yehudayoff\n\nAffiliat
ion: Technion - Israel Institute of Technology\n\n
DTSTART;TZID=America/New_York:20201123T111500
DTEND;TZID=America/New_York:20201123T121500
LAST-MODIFIED:20200923T152705Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-249
END:VEVENT
BEGIN:VEVENT
UID:4bd04f23-92c4-486c-a809-a9b765bd6ea0
DTSTAMP:20201101T020705Z
CREATED:20200827T131956Z
DESCRIPTION:Speakers: Paul Valiant\n\nAffiliation: Member\, School of Mathe
matics\n\n
DTSTART;TZID=America/New_York:20201124T103000
DTEND;TZID=America/New_York:20201124T123000
LAST-MODIFIED:20201028T153605Z
LOCATION:Simonyi Hall 101 and Remote Access - see Zoom link below
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-247
END:VEVENT
BEGIN:VEVENT
UID:dd8867ce-48df-40fd-a24f-50823130923a
DTSTAMP:20201101T020705Z
CREATED:20200827T125037Z
DESCRIPTION:Topic: To Be Announced\n\nSpeakers: Mary Wooters\n\nAffiliation
: Stanford University\n\n
DTSTART;TZID=America/New_York:20201130T111500
DTEND;TZID=America/New_York:20201130T121500
LAST-MODIFIED:20200923T153255Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-245
END:VEVENT
BEGIN:VEVENT
UID:1a9c702f-538b-4566-a5c7-b1256cfb3d8c
DTSTAMP:20201101T020705Z
CREATED:20200827T132021Z
DESCRIPTION:Topic: To Be Announced\n\n
DTSTART;TZID=America/New_York:20201201T103000
DTEND;TZID=America/New_York:20201201T123000
LAST-MODIFIED:20201026T180948Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-248
END:VEVENT
BEGIN:VEVENT
UID:e513ecdb-ad77-474a-913e-9a8786e0cddd
DTSTAMP:20201101T020705Z
CREATED:20200827T131517Z
DESCRIPTION:Topic: To Be Announced\n\nSpeakers: Sumegha Garg\n\nAffiliation
: Harvard University\n\n
DTSTART;TZID=America/New_York:20201207T111500
DTEND;TZID=America/New_York:20201207T121500
LAST-MODIFIED:20201012T123117Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-i-251
END:VEVENT
BEGIN:VEVENT
UID:5cadfd6c-156f-4723-95cd-9cab7aa697a2
DTSTAMP:20201101T020705Z
CREATED:20200827T132041Z
DESCRIPTION:Topic: To Be Announced\n\n
DTSTART;TZID=America/New_York:20201208T103000
DTEND;TZID=America/New_York:20201208T123000
LAST-MODIFIED:20200923T153337Z
LOCATION:
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/events/computer-sciencediscrete-mathematics-seminar
-ii-249
END:VEVENT
END:VCALENDAR