BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alexander SHEN (CNRS LIRMM\, Montpellier)
DTSTART:20250129T160000Z
DTEND:20250129T171500Z
DTSTAMP:20260423T053133Z
UID:AAIT/42
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/42/">Re
 visiting combinatorial applications of information inequalities.</a>\nby A
 lexander SHEN (CNRS LIRMM\, Montpellier) as part of Seminar on Algorithmic
  Aspects of Information Theory\n\n\nAbstract\nThis (short) talk is a react
 ion to Dan Suciu's talk of the last year. He showed some new combinatorial
  inequalities that use L_p-size of sections of some sets. One could note t
 hat they have Kolmogorov complexity versions (even a bit more general that
  give a bound for the pair (C(x)\,C(y|x)) in terms of the section size sta
 tistics)\, and it would be interesting to find out whether one can get a s
 imilar bound for Shannon's entropies.\n
LOCATION:https://researchseminars.org/talk/AAIT/42/
END:VEVENT
END:VCALENDAR