Some Applications of Relative Entropy in Additive Combinatorics

Julia Wolf

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

349 Downloads (Pure)

Abstract

This survey looks at some recent applications of relative entropy in additive combinatorics. Specifically, we examine to what extent entropy-increment arguments can replace or even outperform more traditional energy-increment strategies or alternative approximaion arguments based on the Hahn-Banach theorem.
Original languageEnglish
Title of host publicationSurveys in Combinatrics 2017
PublisherCambridge University Press
Pages409-442
Number of pages34
ISBN (Print)9781108332699
DOIs
Publication statusPublished - Jul 2017

Publication series

NameLondon Mathematical Society Lecture Notes Series
PublisherCambridge University Press
ISSN (Print)0076-0552

Fingerprint Dive into the research topics of 'Some Applications of Relative Entropy in Additive Combinatorics'. Together they form a unique fingerprint.

Cite this