BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Slava Matveev (Leipzig) DTSTART:20260325T160000Z DTEND:20260325T171500Z DTSTAMP:20260423T021344Z UID:AAIT/51 DESCRIPTION:Title: Sp ectral Conditions for the Ingleton Inequality.\nby Slava Matveev (Leip zig) as part of Seminar on Algorithmic Aspects of Information Theory\n\n\n Abstract\nThe Ingleton inequality is a classical linear information inequa lity that holds for representable matroids but fails to be universally val id for entropic vectors. Understanding the extent to which this inequality can be violated has been a longstanding problem in information theory. In this paper\, we show that for a broad class of jointly distributed random variables (X\,Y) the Ingleton inequality holds up to a small additive err or\, even even though the mutual information between X and Y is far from b eing extractable. Contrary to common intuition\, strongly non-extractable mutual information does not lead to large violations of the Ingleton inequ ality in this setting. More precisely\, we consider pairs (X\,Y) that are uniformly distributed on their joint support and whose associated biregula r bipartite graph is an expander. For all auxiliary random variables A and B jointly distributed with (X\,Y)\, we establish a lower bound on the Ing leton quantity I(X:Y|A)+I(X:Y|B)+I(A:B)-I(X:Y) in terms of the spectral pa rameters of the underlying graph. Our proof combines the expander mixing l emma with a partitioning technique for finite sets (cf. Alon\, Newman\, Sh en\, Tardos\, Vereshchagin\, 2007).\n LOCATION:https://researchseminars.org/talk/AAIT/51/ END:VEVENT END:VCALENDAR