BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//85f20b73fecb3e0e6ca434791a2aea4a.ias.edu//NONSGML kigkonsult.se iCalcreator 2.41.90//
CALSCALE:GREGORIAN
UID:62633732-3662-4532-a663-396263363834
X-WR-TIMEZONE:UTC
X-WR-CALNAME:IAS CSDM Seminars
BEGIN:VEVENT
UID:30373762-3138-4437-b265-343838373032
DTSTAMP:20241015T161012Z
CREATED:20240819T132319Z
DESCRIPTION:Topic: An Improved Line-Point Low-Degree Test\n\nSpeakers: Prah
ladh Harsha\, Tata Institute of Fundamental Research\n\nIn this talk\, I'l
l show that the most natural low-degree test for\npolynomials over finite
fields is ``robust'' in the high-error regime\nfor linear-sized fields. Th
is settles a long-standing open question in\nthe area of low-degree testin
g\, yielding an $O(d)$-query robust test\nin the ``high-error'' regime. Th
e previous results in this space\neither worked only in the 'low-error' re
gime (Polishchuk & Spielman\,\nSTOC 1994)\, or required $q= \Omega(d^4)$ (
Arora & Sudan\, Combinatorica\n2003)\, or needed to measure local distance
on 2-dimensional ``planes''\nrather than one-dimensional lines leading to
$\Omega(d^2)$-query\ncomplexity (Raz & Safra\, STOC 1997).\n\nOur main te
chnical novelty is a new analysis in the bivariate setting\nthat exploits
a previously known connection (namely Hensel lifting)\nbetween multivariat
e factorization and finding (or testing) low-degree\npolynomials\, in a no
n ``black-box'' manner in the context of\nroot-finding. \n\nJoint work wit
h Mrinal Kumar\, Ramprasad Saptharishi\, Madhu Sudan.
DTSTART:20240923T150000Z
DTEND:20240923T160000Z
LAST-MODIFIED:20240923T125636Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-575
END:VEVENT
BEGIN:VEVENT
UID:39633461-6262-4663-a139-363365663266
DTSTAMP:20241015T161012Z
CREATED:20240819T132606Z
DESCRIPTION:Topic: Concentration on HDX: Derandomization Beyond Chernoff\n
\nSpeakers: Max Hopkins\, Institute for Advanced Study\n\nChernoff's bound
states that for any $A \subset [N]$ the probability\na random $k$-tuple $
s \in {[N] \choose k}$ correctly `samples'\n$A$ (i.e. that the density of
$A$ in $s$ is close to its mean)\ndecays exponentially in the dimension $k
$. In 1987\, Ajtai\, Komlos\,\nand Szemeredi proved the 'Expander-Chernoff
Theorem'\, a\npowerful _derandomization _of Chernoff's bound stating that
one can\nreplace ${[N] \choose k}$ with the significantly sparser\nfamily
$X_G(k) \subsetneq {[N] \choose k}$ of length-$k$ paths on\nan expander g
raph $G$ while maintaining essentially the same\nconcentration. Their resu
lt\, which allows amplification without\nsignificant blow-up in size or ra
ndomness\, has since become a\nmainstay in theoretical computer science wi
th breakthrough\napplications in derandomization\, coding\, pseudorandomne
ss\,\ncryptography\, and complexity.\n\nOne natural way to view AKS is to
say Expander-Walks are pseudorandom\nwith respect to functions of their ve
rtices\, or against 'degree 1'\nfunctions. In modern complexity\, especial
ly in the context of hardness\namplification and PCPs\, we often need conc
entration against _higher\ndegree _functions\, e.g. functions of edges or
triples. Unfortunately\,\ndue to their inherent _low-dimensionality_\, wal
ks on expanders are\nnot pseudorandom even at degree 2\, and the construct
ion of such a\nde-randomized object has remained largely open. \n\nIn 2017
Dinur and Kaufman offered a partial resolution to this\nquestion in the i
ntroduction of (spectral) _high dimensional\nexpanders\,_ a derandomized f
amily satisfying Chebyshev-type (inverse\npolynomial) concentration for hi
gher degree functions. Their\nwork led to breakthrough applications in agr
eement testing and PCPs\n(Bafna and Minzer 2024)\, but left an exponential
gap with known bounds\nfor the complete hypergraph ${[N] \choose k}$ need
ed for other\napplications. In this talk\, we close this gap and prove (st
rong\nenough) HDX indeed match the concentration of ${[N] \choose k}$. Tim
e\nwilling\, we will additionally discuss the relation of these bounds to
\nagreement testing and a powerful analytic inequality called reverse\nhyp
ercontractivity.\n\nBased on joint work [https://arxiv.org/abs/2404.10961v
1] with Yotam\nDikstein.
DTSTART:20240924T143000Z
DTEND:20240924T163000Z
LAST-MODIFIED:20240924T113541Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-567
END:VEVENT
BEGIN:VEVENT
UID:34356532-6434-4766-a333-396436623938
DTSTAMP:20241015T161012Z
CREATED:20240905T173308Z
DESCRIPTION:Topic: Sorting Using Partial Information\n\nSpeakers: Robert Ta
rjan\, Princeton University\n\nWe consider the problem of sorting a set of
items having an unknown\ntotal order by doing binary comparisons of the i
tems\, given the\noutcomes of some pre-existing comparisons. We present a
simple new\nalgorithm with a running time of O(m + n + log T)\, where n\,
m\, and T\nare the number of items\, the number of pre-existing comparison
s\, and\nthe number of total orders consistent with the outcomes of the\np
re-existing comparisons\, respectively. The algorithm does O(log T)\ncompa
risons. Both our time and comparison bounds are best possible up\nto const
ant factors\, thus resolving a problem that has been open since\n1978. Our
algorithm combines two classic algorithms: topological sort\nand heapsort
with the right kind of heap.\n\nThis is joint work with Bernhard Haeupler
\, Richard Hladík\, John\nlacono\, Vaclay Rozhoi\, and Jakub Tětek.
DTSTART:20240930T150000Z
DTEND:20240930T160000Z
LAST-MODIFIED:20240930T125941Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-581
END:VEVENT
BEGIN:VEVENT
UID:30373331-3461-4564-a163-393765393236
DTSTAMP:20241015T161012Z
CREATED:20240819T184416Z
DESCRIPTION:Topic: A New Approach to Strong Convergence\n\nSpeakers: Ramon
Van Handel\, Institute for Advanced Study\n\nIt was conjectured by Alon in
the 1980s that random d-regular graphs\nhave the largest possible spectra
l gap (up to negligible error) among\nall d-regular graphs. This conjectur
e was proved by Friedman in 2004\nin major tour de force. In recent years\
, deep generalizations of\nFriedman's theorem\, such as strong convergence
of random permutation\nmatrices due to Bordenave and Collins\, have playe
d a central role in a\nseries of breakthrough results on random graphs\, g
eometry\, and\noperator algebras.\n\nIn this talk\, I will discuss a surpr
isingly simple new approach to\nsuch results that is almost entirely based
on soft arguments. This\napproach makes it possible to address previously
inaccessible\nquestions: for example\, it enables a sharp understanding o
f the large\ndeviation probabilities in Friedman's theorem\, and establish
es strong\nconvergence of very high-dimensional representations of the sym
metric\nand classical groups. I will aim to explain some of these results
and\nthe basic ideas on which they are based. \n\nJoint work with Chen\, G
arza-Vargas\, and Tropp.
DTSTART:20241001T143000Z
DTEND:20241001T163000Z
LAST-MODIFIED:20241001T182542Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-568
END:VEVENT
BEGIN:VEVENT
UID:31373738-3935-4434-a465-666664613632
DTSTAMP:20241015T161012Z
CREATED:20240819T183841Z
DESCRIPTION:Topic: Subgroup Tests and the Aldous--Lyons Conjecture\n\nSpeak
ers: Michael Chapman\, New York University\n\nA common theme in mathematic
s is that limits of finite objects are\nwell behaved. This allows one to p
rove many theorems about FINITELY\nAPPROXIMABLE objects\, while leaving th
e general case open ---\nexamples for this are Gottschalk's conjecture\, K
aplansky's direct\nfiniteness conjecture\, and many more. When the topolog
y of the space\nis somewhat coarse\, it becomes very hard to decide\nwheth
er EVERY object is approximable by finite ones\, or whether\nthere exist N
ON-APPROXIMABLE objects. Some of the more famous\nproblems in various fiel
ds of mathematics can be framed this way\; this\nincludes Connes' embeddin
g problem (CEP) in functional analysis\, the\nAldous--Lyons conjecture in
probability theory\, the soficity problem\nof Gromov--Weiss in group theor
y\, and more. \n\nIn 2019\, Ji--Natarajan--Vidick--Wright--Yuen resolved C
EP in the\nnegative\, namely\, they showed that there are non-approximable
\ncharacters of the free group. The amazing thing about their result is\nt
hat it is deduced from COMPLEXITY THEORY\, and specifically from\nundecida
bility in certain (quantum) interactive proof systems.\nInspired by their
work\, we suggest a novel interactive proof system\nwhich is related to th
e Aldous--Lyons conjecture in the following way:\nIf the Aldous--Lyons con
jecture was true\, then every language in this\ninteractive proof system i
s decidable. A key concept we introduce for\nthis purpose is that of a Sub
group Test\, which is our analogue of a\nNon-local Game. By providing a re
duction from the Halting Problem to\nthis new proof system\, we refute the
Aldous-Lyons conjecture.\n\nIn this first talk we introduce the main conc
epts\, motivate the\nconjecture and give a high level description of the p
roof\nstrategy. NO SPECIAL MATHEMATICAL BACKGROUND WILL BE ASSUMED.\n\nThi
s talk is based on a joint work with Lewis Bowen\, Alex Lubotzky and\nThom
as Vidick.
DTSTART:20241007T143000Z
DTEND:20241007T153000Z
LAST-MODIFIED:20241007T112639Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-577
END:VEVENT
BEGIN:VEVENT
UID:31666634-3562-4336-a131-613339373564
DTSTAMP:20241015T161012Z
CREATED:20240819T184532Z
DESCRIPTION:Topic: Subgroup Tests and Tailored Non-local Games\n\nSpeakers:
Michael Chapman\, New York University\n\nIn the previous talk\, we define
d Subgroup Tests and the interactive\nproof system induced by them. In add
ition\, we showed that if the\nAldous--Lyons conjecture was true\, then th
is interactive proof system\ncontains only decidable languages. In this ta
lk\, we describe why the\nHalting Problem can be decided in our interactiv
e proof system\, which\nin turn refutes the Aldous--Lyons conjecture. This
is done in two\nsteps: The first relates Subgroup Test to a new subclass
of non-local\ngames which we term Tailored Games. The second shows that th
e\ntechniques of MIP*=RE can be refined so that all the games in it are\nt
ailored\, or in acronym fashion\, that Tailored-MIP*=RE.\n\nThis talk is b
ased on a joint work with Lewis Bowen\, Alex Lubotzky and\nThomas Vidick.
DTSTART:20241008T143000Z
DTEND:20241008T163000Z
LAST-MODIFIED:20241008T120211Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-569
END:VEVENT
BEGIN:VEVENT
UID:63303136-3736-4539-b832-336261643035
DTSTAMP:20241015T161012Z
CREATED:20240819T183941Z
DESCRIPTION:Topic: Analytic Insights into the Zig-Zag Product and Its Frien
ds: Part I\n\nSpeakers: Gil Cohen\, Tel Aviv University\n\nThe well-known
Zig-Zag product and related graph operators\, like\nderandomized squaring\
, are fundamentally combinatorial in nature.\nClassical bounds on their be
havior often rely on a mix of\ncombinatorics and linear algebra. However\,
these traditional bounds\nare not tight and frequently fail to align with
experimental results.\n\nIn these talks\, we will present a more refined
analysis that utilizes\nthe full spectrum of the graph\, rather than relyi
ng solely on its\nspectral expansion. This approach produces results that
both match\nexperimental observations and\, in a sense\, are proved to be
optimal.\nOur technique is analytic\, diverging from classical methods: fo
r the\nupper bound\, we apply finite free probability\, while for the lowe
r\nbound\, we draw on results from analytic combinatorics. \n\nBased on jo
int works with Itay Cohen\, Gal Maor\, and Yuval Peled.\n\nNo prior knowle
dge is required.\n\nRelevant papers:\n\n * Random Walks on Rotating Expande
rs (STOC 2023)\n * Tight Bounds for the Zig-Zag Product (FOCS 2024)\n * Dera
ndomized Squaring: An Analytic Insight into Its True Behavior\n(manuscript
)
DTSTART:20241014T143000Z
DTEND:20241014T153000Z
LAST-MODIFIED:20241014T141145Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-578
END:VEVENT
BEGIN:VEVENT
UID:66663332-6135-4532-a263-376537346539
DTSTAMP:20241015T161012Z
CREATED:20240819T184558Z
DESCRIPTION:Topic: Analytic Insights into the Zig-Zag Product and Its Frien
ds: Part II\n\nSpeakers: Gil Cohen\, Tel Aviv University\n\nThe well-known
Zig-Zag product and related graph operators\, like\nderandomized squaring
\, are fundamentally combinatorial in nature.\nClassical bounds on their b
ehavior often rely on a mix of\ncombinatorics and linear algebra. However\
, these traditional bounds\nare not tight and frequently fail to align wit
h experimental results.\n\nIn these talks\, we will present a more refined
analysis that utilizes\nthe full spectrum of the graph\, rather than rely
ing solely on its\nspectral expansion. This approach produces results that
both match\nexperimental observations and\, in a sense\, are proved to be
optimal.\nOur technique is analytic\, diverging from classical methods: f
or the\nupper bound\, we apply finite free probability\, while for the low
er\nbound\, we draw on results from analytic combinatorics. \n\nBased on j
oint works with Itay Cohen\, Gal Maor\, and Yuval Peled.\n\nNo prior knowl
edge is required.\n\nRelevant papers:\n\n * Random Walks on Rotating Expand
ers (STOC 2023)\n * Tight Bounds for the Zig-Zag Product (FOCS 2024)\n * Der
andomized Squaring: An Analytic Insight into Its True Behavior\n(manuscrip
t)
DTSTART:20241015T143000Z
DTEND:20241015T163000Z
LAST-MODIFIED:20241004T142138Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-570
END:VEVENT
BEGIN:VEVENT
UID:61633030-6139-4766-a536-393032663135
DTSTAMP:20241015T161012Z
CREATED:20240819T184002Z
DESCRIPTION:Topic: When and How are (promise) Constraint Satisfaction Probl
ems Efficiently Solvable?\n\nSpeakers: Venkatesan Guruswami\, University o
f California\, Berkeley\n\nComputational problems exhibit a diverse range
of behaviors in terms\nof how quickly and effectively they can be solved.
What underlying\nmathematical structure (or lack thereof) in a computatio
nal problem\nleads to an efficient algorithm for solving it (or dictates i
ts\nintractability)? Given the vast landscape of problems and algorithmic
\napproaches\, it would be simplistic to hope for a universal theory\nexpl
aining the underpinnings of easiness/hardness. Yet\, in the realm\nof con
straint satisfaction problems (CSP)\, the algebraic dichotomy\ntheorem giv
es a definitive answer: a polynomial time algorithm exists\nwhen there are
non-trivial local operations called polymorphisms under\nwhich the soluti
on space is closed\; otherwise the problem is\nNP-complete. \n\nEmboldened
by this\, one might speculate a polymorphic principle in\nmore general co
ntexts\, with appropriate notions of symmetries\ngoverning the existence o
f efficientalgorithms. Beginning with some\nbackground on CSP and the poly
morphic approach to understand their\ncomplexity\, the talk will discuss s
ome extensions beyond CSP where the\npolymorphic principle seems promising
(yet far from understood). In\nparticular\, we will discuss ``promise CSP
'' where one is allowed to\nsatisfy a relaxed version of the constraints\,
a framework that\nincludes problems such as approximate graph coloring an
d discrepancy\nminimization. We will provide glimpses of the emerging theo
ry\ncharacterizing the (in)tractability of interesting classes of promise
\nCSP and the ability of natural classes of algorithms (linear and\naffine
relaxations) to solve them\, and highlight some of the many\nchallenges t
hat remain.
DTSTART:20241021T143000Z
DTEND:20241021T153000Z
LAST-MODIFIED:20241002T172038Z
LOCATION:Wolfensohn Hall and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-579
END:VEVENT
BEGIN:VEVENT
UID:38393861-3238-4434-a664-366335306334
DTSTAMP:20241015T161012Z
CREATED:20240819T184627Z
DESCRIPTION:Topic: Sheaves on Graphs\, the Hanna Neumann Conjecture\, and M
y Debt to Number Theory and Algebraic Geometry\n\nSpeakers: Joel Friedman\
, The University of British Columbia\n\nI will discuss the Hanna Neumann c
onjecture of the 1950's and some\ntools in graph theory that I used to sol
ve it. The tools include\nsheaf theory on graphs\, Galois theory for grap
hs\, and the preservation\nof 'local properties' under base change (for gr
aphs). Time\npermitting\, I will mention one or two other applications of
sheaves on\ngraphs.\n\nThis talk assumes only basic graph theory and line
ar algebra. This\ntalk will not mention any number theory or algebraic ge
ometry per se\,\nexcept possibly Chevalley's Theorem on constructible sets
.
DTSTART:20241022T143000Z
DTEND:20241022T163000Z
LAST-MODIFIED:20241007T122729Z
LOCATION:Rubenstein Commons | Meeting Room 5
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-571
END:VEVENT
BEGIN:VEVENT
UID:35646237-3465-4336-b262-636136396631
DTSTAMP:20241015T161012Z
CREATED:20240819T184059Z
DESCRIPTION:Speakers: Mitali Bafna\, Massachusetts Institute of Technology
DTSTART:20241104T153000Z
DTEND:20241104T163000Z
LAST-MODIFIED:20241002T115925Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-580
END:VEVENT
BEGIN:VEVENT
UID:39613839-6135-4937-b664-303630343434
DTSTAMP:20241015T161012Z
CREATED:20240819T184721Z
DESCRIPTION:Speakers: Mitali Bafna\, Massachusetts Institute of Technology
DTSTART:20241105T153000Z
DTEND:20241105T173000Z
LAST-MODIFIED:20240822T135359Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-572
END:VEVENT
BEGIN:VEVENT
UID:63643331-6433-4536-a538-616135363331
DTSTAMP:20241015T161012Z
CREATED:20240819T184209Z
DESCRIPTION:Speakers: David (Ting-Chun) Lin\, University of California San
Diego
DTSTART:20241111T153000Z
DTEND:20241111T163000Z
LAST-MODIFIED:20241002T115956Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-576
END:VEVENT
BEGIN:VEVENT
UID:38323737-3631-4166-b735-326233353332
DTSTAMP:20241015T161012Z
CREATED:20240819T184755Z
DESCRIPTION:Speakers: Peter van Hintum\, Institute for Advanced Study
DTSTART:20241112T153000Z
DTEND:20241112T173000Z
LAST-MODIFIED:20241011T131817Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-573
END:VEVENT
BEGIN:VEVENT
UID:61663965-3330-4433-b837-323965383566
DTSTAMP:20241015T161012Z
CREATED:20240819T184233Z
DESCRIPTION:Speakers: Maria Chudnovsky\, Princeton University
DTSTART:20241118T153000Z
DTEND:20241118T163000Z
LAST-MODIFIED:20241002T120108Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-582
END:VEVENT
BEGIN:VEVENT
UID:32316134-3136-4839-b938-336562313330
DTSTAMP:20241015T161012Z
CREATED:20240819T184812Z
DESCRIPTION:Speakers: Peter van Hintum\, Institute for Advanced Study
DTSTART:20241119T153000Z
DTEND:20241119T173000Z
LAST-MODIFIED:20241011T131851Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-574
END:VEVENT
BEGIN:VEVENT
UID:64636532-3761-4365-b766-393231386431
DTSTAMP:20241015T161012Z
CREATED:20240819T184255Z
DESCRIPTION:Speakers: Yuval Ishai\, Technion
DTSTART:20241125T153000Z
DTEND:20241125T163000Z
LAST-MODIFIED:20241002T120154Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-583
END:VEVENT
BEGIN:VEVENT
UID:34383165-6166-4263-b161-643062313733
DTSTAMP:20241015T161012Z
CREATED:20240819T184831Z
DESCRIPTION:Speakers: Yotam Dikstein\, Institute for Advanced Study
DTSTART:20241126T153000Z
DTEND:20241126T173000Z
LAST-MODIFIED:20241011T133520Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-575
END:VEVENT
BEGIN:VEVENT
UID:31386436-3765-4439-b433-653064626437
DTSTAMP:20241015T161012Z
CREATED:20240819T184318Z
DESCRIPTION:Speakers: Henry Yuen\, Columbia University
DTSTART:20241202T153000Z
DTEND:20241202T163000Z
LAST-MODIFIED:20241002T120328Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-584
END:VEVENT
BEGIN:VEVENT
UID:30303836-6135-4438-a333-303739373330
DTSTAMP:20241015T161012Z
CREATED:20240819T184855Z
DESCRIPTION:Speakers: Orit Raz\, Institute for Advanced Study
DTSTART:20241203T153000Z
DTEND:20241203T173000Z
LAST-MODIFIED:20240924T153431Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-576
END:VEVENT
BEGIN:VEVENT
UID:35376562-3530-4034-b563-373563386361
DTSTAMP:20241015T161012Z
CREATED:20240819T184342Z
DESCRIPTION:
DTSTART:20241209T153000Z
DTEND:20241209T163000Z
LAST-MODIFIED:20241002T120403Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar I
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-i-585
END:VEVENT
BEGIN:VEVENT
UID:32663435-3238-4961-b261-623130326332
DTSTAMP:20241015T161012Z
CREATED:20240819T184916Z
DESCRIPTION:Speakers: Zander Kelley\, Institute for Advanced Study
DTSTART:20241210T153000Z
DTEND:20241210T173000Z
LAST-MODIFIED:20241011T131736Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-577
END:VEVENT
BEGIN:VEVENT
UID:66303162-6237-4361-b535-333561303333
DTSTAMP:20241015T161012Z
CREATED:20241011T133606Z
DESCRIPTION:Speakers: Zander Kelley\, Institute for Advanced Study
DTSTART:20241217T153000Z
DTEND:20241217T173000Z
LAST-MODIFIED:20241011T133623Z
LOCATION:Simonyi 101 and Remote Access
SUMMARY:Computer Science/Discrete Mathematics Seminar II
URL:https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-se
minar-ii-578
END:VEVENT
END:VCALENDAR