Abstract
During the discussion on Thursday afternoon, the audience will select a talk to continue on Friday morning.
We describe the intuition behind the proof of our algorithmic characterization of a class of inequalities that generalizes Cauchy-Schwarz, Holder’s inequality, and the monotonicity of the Lp norm, and products of such inequalities. Such inequalities arise in many settings, and our algorithmic characterization provides an efficient algorithm that either proves or provides a witness that falsifies a given inequality in the class.