BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alexander Shen (CNRS - LIRMM)
DTSTART;VALUE=DATE-TIME:20221207T160000Z
DTEND;VALUE=DATE-TIME:20221207T171500Z
DTSTAMP;VALUE=DATE-TIME:20230208T065345Z
UID:AAIT/1
DESCRIPTION:Title: Inf
ormation inequalities: combinatorial interpretation\nby Alexander Shen
(CNRS - LIRMM) as part of Seminar on Algorithmic Aspects of Information T
heory\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/AAIT/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Frederique Oggier (Nanyang Technological University)
DTSTART;VALUE=DATE-TIME:20230104T160000Z
DTEND;VALUE=DATE-TIME:20230104T171500Z
DTSTAMP;VALUE=DATE-TIME:20230208T065345Z
UID:AAIT/2
DESCRIPTION:Title: An
overview of Ingleton's inequality from a group theory point of view.\n
by Frederique Oggier (Nanyang Technological University) as part of Seminar
on Algorithmic Aspects of Information Theory\n\n\nAbstract\nWe will revie
w several works that use group theory to approach Ingleton's inequality an
d entropic vectors.\n
LOCATION:https://researchseminars.org/talk/AAIT/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cheuk Ting LI (Chinese University of Hong Kong)
DTSTART;VALUE=DATE-TIME:20230118T160000Z
DTEND;VALUE=DATE-TIME:20230118T171500Z
DTSTAMP;VALUE=DATE-TIME:20230208T065345Z
UID:AAIT/3
DESCRIPTION:Title: Exi
stential information inequalities\, non-Shannon inequalities\, and automat
ed theorem proving.\nby Cheuk Ting LI (Chinese University of Hong Kong
) as part of Seminar on Algorithmic Aspects of Information Theory\n\n\nAbs
tract\nExistential information inequality is a generalization of linear in
formation inequalities\, where random variables can not only be universall
y quantified\, but also existentially quantified. We study the structure o
f existential information inequalities\, and describe algorithms for autom
ated verification of existential information inequalities\, which are also
useful for proving (non-existential) non-Shannon inequalities. We also de
scribe how a wide range of results in network information theory (e.g. 32
out of 56 theorems in Chapters 1-14 of Network Information Theory by El Ga
mal and Kim) can be proved automatically using the proposed algorithms. Th
e algorithms are implemented in the PSITIP framework ( github.com/cheuktin
gli/psitip ).\n
LOCATION:https://researchseminars.org/talk/AAIT/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexander Kozachinskiy (Catholic University of Chile)
DTSTART;VALUE=DATE-TIME:20230201T160000Z
DTEND;VALUE=DATE-TIME:20230201T171500Z
DTSTAMP;VALUE=DATE-TIME:20230208T065345Z
UID:AAIT/4
DESCRIPTION:Title: On
the recent progress on Frankl's conjecture.\nby Alexander Kozachinskiy
(Catholic University of Chile) as part of Seminar on Algorithmic Aspects
of Information Theory\n\n\nAbstract\nFrankl's conjecture states that for a
ny non-empty family of non-empty finite sets which is closed under finite
union there exists an element belonging to at least 1/2 of the sets from t
he family. I will present a recent result of Gilmer that this conjecture h
olds for some positive constant.\n
LOCATION:https://researchseminars.org/talk/AAIT/4/
END:VEVENT
END:VCALENDAR