Mitch
Reputation
352
Top tag
Next privilege 500 Rep.
Access review queues
 Apr 29 awarded Good Answer Oct 16 awarded Nice Question Apr 25 accepted Anti-concentration of Gaussian quadratic form Apr 25 awarded Commentator Apr 25 comment Anti-concentration of Gaussian quadratic form Yes, I would expect $c=1/2,$ but I don't want to discourage somebody with an answer that gives $c<1/2.$ Apr 25 revised Anti-concentration of Gaussian quadratic form deleted 13 characters in body Apr 25 comment Anti-concentration of Gaussian quadratic form No, it's supposed to be an absolute constant independent of $a_1,\dots,a_n$ and $n$. I will update the question. Apr 25 asked Anti-concentration of Gaussian quadratic form Jul 20 awarded Nice Answer Jun 7 awarded Nice Answer Oct 21 awarded Yearling Aug 24 awarded Nice Answer Feb 3 awarded Enthusiast Feb 1 answered Which popular games are the most mathematical? Jan 17 comment linear program with zeros I guess, appropriately rephrased this could be a somewhat interesting math overflow question. Like, what algorithms/heuristics are known to solve mixed integer linear programs, which instances are easy etc. Jan 17 comment linear program with zeros looks more like a quadratic program than a linear program, since you can express that a variable is either zero or one. You can't hope to solve this efficiently in general. Look for integer linear programming solvers on the web. Jan 16 accepted Deciding membership in a convex hull Jan 14 awarded Editor Jan 14 comment Algorithm for decomposing permutations So, the solution could have exponential length so that you can't write it out in polynomial time. Instead you release, say, a Turing machine which on input $i$ returns the permutation $g_i$. This can be done efficiently. Jan 14 revised Algorithm for decomposing permutations added 8 characters in body