Location: ** CoRE 301**

Date & time: Wednesday, 14 February 2018 at 11:00AM - 12:00PM

Abstract: In this talk, we consider the problem of explicitly constructing a binary tree code with constant distance and constant alphabet size. We give 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 a suitable basis--a result of independent interest.

Joint work with Bernhard Haeupler and Leonard Schulman.

Arthur Wang Organizer's Page

Charles Weibel Organizer's Page

Brooke Logan

Wujun Zhang, Rick Falk Organizer's Page

Xiaojun Huang, Jian Song, Sagun Chanillo

Pranjal Awasthi, Shubhangi Saraf Organizer's Page

Jeffry Kahn, Bhargav Narayanan, Abigail Raz Organizer's Page

Bryan Ek, Doron Zeilbrger Organizer's Page

Paul Feehan, Manousos Maridakis, Natasa Sesum seminar webpage

Borisov, Diaconescu, Tarasca, Woodward

Alejandro Ginory Organizer's Page

Jason Saied, Corrine Yap Organizer's Page

Erik De Amorim Organizer's Page

Yonah Biers-Ariel Organizer's Page

Katie McKeon Organizer's Page

Yanyan Li, Zheng-Chao Han, Jian Song, Natasa Sesum

Lisa Carbone, Yi-Zhi Huang, James Lepowsky, Siddhartha Sahi Organizer's page

Grigor Sargsyan seminar website

Kasper Larsen, Daniel Ocone and Kim Weston Organizer's page

Joel Lebowitz, Michael Kiessling

Yanyan Li, Haim Brezis

Matthew C Welsh

Stephen D. Miller, John C. Miller, Alex V. Kontorovich, Claire Burrin seminar website

Stephen D. Miller

Matthew Charnley Organizer's Page

Feng Luo, Xiaochun Rong, Hongbin Sun Organizer's page

M. Lienert seminar webpage

Organizer: Vladimir Retakh Organizer's page

Claire Burrin, Amita Malik, Kei Nakamura

- Show events from all categories

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

*Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.*

Department of Mathematics
Rutgers University Hill Center - Busch Campus 110 Frelinghuysen Road Piscataway, NJ 08854-8019, USA Phone: +1.848.445.2390 Fax: +1.732.445.5530 |