BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Raymond W. Yeung (The Chinese University of Hong Kong)
DTSTART:20260422T150000Z
DTEND:20260422T161500Z
DTSTAMP:20260423T034445Z
UID:AAIT/53
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/53/">In
 equalities Revisited.</a>\nby Raymond W. Yeung (The Chinese University of 
 Hong Kong) as part of Seminar on Algorithmic Aspects of Information Theory
 \n\n\nAbstract\nIn the past over two decades\, researchers in information 
 theory have obtained very fruitful results in the study of the Shannon ent
 ropy. This study has led to the discovery of a new class of constraints on
  the Shannon entropy\, called non-Shannon-type inequalities. Intimate conn
 ections between the Shannon entropy and different branches of mathematics 
 including finite group theory\, combinatorics\, Kolmogorov complexity\, pr
 obability\, matrix theory\, etc\, have been established. All these discove
 ries are based on a geometrical interpretation of constraints on the entro
 py function. We assert that the same formality can be applied to the study
  of inequalities in other branches of mathematics. To illustrate the idea\
 , we revisit with this formality a few celebrated inequalities: the AM—G
 M inequality\, the Markov inequality\, and the Cauchy—Schwarz inequality
 . Applications of this formality has the potential of leading to the disco
 very of new inequalities in different branches of mathematics.\n
LOCATION:https://researchseminars.org/talk/AAIT/53/
END:VEVENT
END:VCALENDAR