Skip to main content

Timeline for An $L^0$ Khintchine inequality

Current License: CC BY-SA 4.0

16 events
when toggle format what by license comment
S Apr 12 at 9:06 history suggested The Amplitwist CC BY-SA 4.0
fixed broken link to Wikipedia
Apr 12 at 7:22 review Suggested edits
S Apr 12 at 9:06
Jul 15, 2020 at 12:37 history edited George Lowther CC BY-SA 4.0
deleted 16 characters in body
Jul 10, 2020 at 8:41 history edited George Lowther CC BY-SA 4.0
added 76 characters in body
Jul 10, 2020 at 7:36 history edited George Lowther CC BY-SA 4.0
added 4 characters in body
Jul 10, 2020 at 7:29 history edited George Lowther CC BY-SA 4.0
added 231 characters in body
Jul 9, 2020 at 13:18 history edited George Lowther CC BY-SA 4.0
added 544 characters in body
Nov 8, 2018 at 21:44 answer added Ravi Boppana timeline score: 10
Apr 13, 2017 at 12:58 history edited CommunityBot
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Jun 3, 2015 at 19:58 answer added Iosif Pinelis timeline score: 13
Jan 31, 2011 at 20:17 history edited George Lowther CC BY-SA 2.5
grammar. non-strict inequality
Jan 31, 2011 at 12:52 comment added George Lowther Considering $a=(1,1,1,1,1,1)/\sqrt{6}$ gives a probability of $7/2^5=0.21875$. Wonder how close that is to optimal?
Jan 31, 2011 at 11:08 comment added Shai Covo ${\rm P}(|S| \geq 1) = 2[1-{\rm P}(S \lt 1)]$; ${\bf Problem 10} \star$ in math.leidenuniv.nl/~naw/home/ps/pdf/2008-2.pdf (perhaps open) asks for the probability ${\rm P}(S \lt 1)$.
Jan 31, 2011 at 10:07 vote accept George Lowther
Jan 31, 2011 at 8:46 answer added Anthony Quas timeline score: 24
Jan 31, 2011 at 3:36 history asked George Lowther CC BY-SA 2.5