Skip to main content
5 events
when toggle format what by license comment
Aug 27, 2014 at 16:59 comment added Elwood Thanks for the answer, I didn't know about these references. Generalizing the approach to higher order polynomials looks like a combinatorial nightmare to me, no?
Aug 27, 2014 at 14:34 comment added Bill Johnson The most classical proof of Khintchine's inequality is obtained by proving it first for $p$ an even integer (just expand and compute). This gets the inequality for $p>2$. Then extrapolate to obtain it for $p<2$. This elementary proof gives the best order of constant, $\sqrt{p}$ as $p\to \infty$. The best constants were proved by Szarek ($p=2$) and Haagerup (general $p$) in the 1970s.
Aug 27, 2014 at 13:16 history edited Elwood CC BY-SA 3.0
added 111 characters in body
Aug 27, 2014 at 13:08 history edited Elwood CC BY-SA 3.0
added 111 characters in body
Aug 27, 2014 at 13:01 history asked Elwood CC BY-SA 3.0