BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Ical
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
RDATE:20191027T020000
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190329T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.79798.field_date.0@mathematics.huji.ac.il
DTSTAMP:20191117T061703Z
CREATED:20190306T040004Z
DESCRIPTION:Date: \n\n11:00am to 1:00pm\n\n\n\n\nSee also: Combinatorics\
, Events & Seminars\, SeminarsLocation: \n\nCS B-500\, Safra campus\n\n\nS
peaker: Eyal Karni\, BIU\n\nTitle: Combinatorial high dimensional expande
rs\n\nAbstract:\nAn eps-expander is a graph G=(V\,E) in which every set of
vertices X where |X|=eps*|X| . There are many edges that 'go out' from an
y relevant set. \n\nOver the last two decades or so\, there have been var
ious attempts to generalize this notion to higher dimensions. That means t
o talk about expansion in hypergraphs. There has been a growing interest i
n this field\, motivated partially by its usefulness to constructing quant
um error correcting codes. As the field is still in its infancy\, There ar
e limited ways to construct high dimensional expanders\, and they typicall
y rely upon heavy algebraic tools\, while the hypergraphs are defined expl
icitly. \n\nIn his paper from 2017\, David Conlon offered a simple combina
torial way to construct a 3 uniform hypergraph that satisfies some HD expa
nsion properties. It is also randomizable\, and edge-triangle-edge random
walks on it converge rapidly. But\, it has a drawback. It is based upon A
belian groups\, so the provided expansion is limited. \n\nThere were some
recent attempts to tackle that. Namely\, in a paper by Michael Chapman\, N
ati Linial\, Yuval Peled and an attempt by myself (under the guidance of T
ali Kaufman).\nThe idea was also generalized recently to higher dimensions
by David Conlon. \n\nWe will discuss the construction\, its adaptions an
d generalizations. \n(well\, some of them\, as much as the time allows).
\n---\n\n Export\n \n\n \nsubscribe iCal
DTSTART;TZID=Asia/Jerusalem:20190415T110000
DTEND;TZID=Asia/Jerusalem:20190415T130000
LAST-MODIFIED:20190414T220008Z
SUMMARY:Combinatorics: problem session
URL;TYPE=URI:https://mathematics.huji.ac.il/event/combinatorics-eyal-karni-
tba
END:VEVENT
END:VCALENDAR