BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Chandra NAIR and Chin Wa (Ken) LAU (the Chinese University of Hong Kong) DTSTART:20241211T160000Z DTEND:20241211T171500Z DTSTAMP:20260423T040002Z UID:AAIT/40 DESCRIPTION:Title: Ad ditive Combinatorics\, Abelian Groups\, and Entropic Inequalities.\nby Chandra NAIR and Chin Wa (Ken) LAU (the Chinese University of Hong Kong) as part of Seminar on Algorithmic Aspects of Information Theory\n\n\nAbstr act\nuzsa’s equivalence theorem provided a framework for converting cert ain families of inequalities in additive combinatorics to entropic inequal ities (which sometimes did not possess stand-alone entropic proofs). In th is talk\, we first establish formal equivalences between some families (di fferent from Ruzsa) of inequalities in additive combinatorics and entropic ones. Secondly\, we provide stand-alone entropic proofs for previously kn own entropic inequalities that we established via Ruzsa’s equivalence th eorem. As a first step to further these equivalences\, we establish an inf ormation-theoretic characterization of the magnification ratio of independ ent interest.\n\nThis talk is based on the following paper: Information In equalities via Ideas from Additive Combinatorics (conference version ISIT 2023: C. W. Ken Lau and C. Nair\, "Information Inequalities via Ideas from Additive Combinatorics\," 2023 IEEE International Symposium on Informatio n Theory (ISIT)\, Taipei\, Taiwan\, 2023\, pp. 2452-2457\, doi: 10.1109/IS IT54713.2023.10206561.\n LOCATION:https://researchseminars.org/talk/AAIT/40/ END:VEVENT END:VCALENDAR