<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 15 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri",sans-serif;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:#0563C1;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:#954F72;
text-decoration:underline;}
p
{mso-style-priority:99;
mso-margin-top-alt:auto;
margin-right:0in;
mso-margin-bottom-alt:auto;
margin-left:0in;
font-size:12.0pt;
font-family:"Times New Roman",serif;}
pre
{mso-style-priority:99;
mso-style-link:"HTML Preformatted Char";
margin:0in;
margin-bottom:.0001pt;
font-size:10.0pt;
font-family:"Courier New";}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri",sans-serif;
color:windowtext;}
span.HTMLPreformattedChar
{mso-style-name:"HTML Preformatted Char";
mso-style-priority:99;
mso-style-link:"HTML Preformatted";
font-family:"Courier New";}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"Calibri",sans-serif;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-US link="#0563C1" vlink="#954F72"><div class=WordSection1><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>INSTITUTE FOR ADVANCED STUDY<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>School of Mathematics<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Princeton, NJ 08540<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><b><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Theoretical Computer Science/Discrete Math Seminars<o:p></o:p></span></b></pre><pre><b><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Week of April 9, 2018<o:p></o:p></span></b></pre><pre><b><span style='font-size:14.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></b></pre><pre><b><span style='font-size:14.0pt;font-family:"Times New Roman",serif'>***<u>Please note</u>: The April 9<sup>th</sup> and 10<sup>th</sup> CSDM Seminars will be held in the West Building Lecture Hall.*** <o:p></o:p></span></b></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>--------------<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>To view mathematics in titles and abstracts, please click on the talk's link.<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>--------------<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><b><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Monday, April 9<o:p></o:p></span></b></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Computer Science/Discrete Mathematics Seminar I<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Topic: To Be Announced<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Speaker: Eyal Lubetzky, New York University<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Time/Room: 11:00am - 12:15pm/West Building Lecture Hall<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><b><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></b></pre><pre><b><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Tuesday, April 10<o:p></o:p></span></b></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Computer Science/Discrete Mathematics Seminar II<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Topic: Explicit Binary Tree Codes with Polylogarithmic Size Alphabet<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Speaker: Gil Cohen, Princeton University<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Time/Room: 10:30am - 12:30pm/West Building Lecture Hall<o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'>Abstract Link: <a href="http://www.math.ias.edu/seminars/abstract?event=129076">http://www.math.ias.edu/seminars/abstract?event=129076</a><o:p></o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><pre><span style='font-size:11.0pt;font-family:"Times New Roman",serif'><o:p> </o:p></span></pre><p class=MsoNormal style='margin-bottom:12.0pt'><span style='font-family:"Times New Roman",serif'>1 Explicit Binary Tree Codes with Polylogarithmic Size Alphabet <br> Gil Cohen <o:p></o:p></span></p><p><span style='font-size:11.0pt'>In this talk, we consider the problem of explicitly constructing a binary tree code with constant distance and constant alphabet size. We present an explicit binary tree code with constant distance and alphabet size polylog(n), where n is the depth of the tree. This is the first improvement over a two-decade-old construction that has an exponentially larger alphabet of size poly(n). For analyzing our construction, we prove a bound on the number of integral roots a real polynomial can have in terms of its sparsity with respect to the Newton basis - a result of independent interest.<br> <br>Joint work with Bernhard Haeupler and Leonard Schulman.<o:p></o:p></span></p><p class=MsoNormal><span style='font-family:"Times New Roman",serif'><a href="http://www.math.ias.edu/seminars/abstract?event=129076">http://www.math.ias.edu/seminars/abstract?event=129076</a><br><br><br><o:p></o:p></span></p><p class=MsoNormal><span style='font-family:"Times New Roman",serif'><o:p> </o:p></span></p><p class=MsoNormal><span style='font-family:"Times New Roman",serif'><o:p> </o:p></span></p><p class=MsoNormal><span style='font-family:"Times New Roman",serif'>----------------------------------------------<o:p></o:p></span></p><p class=MsoNormal><span style='font-family:"Times New Roman",serif'>Computer Science/Discrete Math Seminars can be found on our web page:<br><br><a href="http://www.math.ias.edu/csdm">http://www.math.ias.edu/csdm</a><br><a href="http://www.math.ias.edu/">http://www.math.ias.edu</a><o:p></o:p></span></p></div></body></html>