BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//7.4.2//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:59@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20230607T143000

DTEND;TZID=Asia/Jerusalem:20230607T152000

DTSTAMP:20250109T093527Z

URL:https://math.technion.ac.il/events/daniel-carmon/

SUMMARY:Daniel Carmon -- Dual systolic graphs
DESCRIPTION:Lecturer:Daniel Carmon\n Location:814 Amado\n We define a famil
 y of graphs we call dual systolic graphs. This definition comes from graph
 s that are duals of systolic simplicial complexes. Our main result is a sh
 arp (up to constants) isoperimetric inequality for dual systolic graphs. T
 he first step in the proof is an extension of the classical isoperimetric 
 inequality of the boolean cube. The isoperimetric inequality for dual syst
 olic graphs\, however\, is exponentially stronger than the one for the boo
 lean cube. Interestingly\, we know that dual systolic graphs exist\, but w
 e do not yet know how to efficiently construct them. We\, therefore\, defi
 ne a weaker notion of dual systolicity. We prove the same isoperimetric in
 equality for weakly dual systolic graphs\, and at the same time provide an
  efficient construction of a family of graphs that are weakly dual systoli
 c. We call this family of graphs clique products. We show that there is a 
 non-trivial connection between the small set expansion capabilities and th
 e threshold rank of clique products\, and believe they can find further ap
 plications.\n 
CATEGORIES:Combinatorics Seminar,Seminars
LOCATION:814 Amado

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:DAYLIGHT

DTSTART:20230324T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

END:VTIMEZONE
END:VCALENDAR