Reputation
3,492
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
16 34
Impact
~104k people reached

Apr
19
comment Multivariate CLT with varying dimension size
It's not known if the $d^{1/4}$ is optimal (the best lower bounds are only logarithmic, I think), but I think there is some feeling that it may in fact be optimal. Partly this comes from the feeling that the main contributor to the error comes from the 'Gaussian surface area' of sets. And it is known (thanks to Fedja Nazarov, scholar.google.com/…) that there are convex sets in $d$ dimensions with Gaussian surface area proportional to $d^{1/4}$. This hasn't been turned into a lower bound, though, as far as I know.
Apr
7
answered Famous results about the value of a given limit assuming it exists
Mar
29
comment Complexity of graph isomorphism
Yeah, in his talk at CMU I vaguely remember him saying something like $c = 11$.
Jan
13
answered Multivariate CLT with varying dimension size
Dec
27
answered In what types of graphs can the maximum independent set be found in polynomial time?
Nov
18
awarded  Nice Question
Nov
12
awarded  Taxonomist
Nov
2
awarded  Popular Question
Oct
18
awarded  Yearling
Oct
6
awarded  Nice Answer
Oct
5
answered Proposals for polymath projects
Sep
24
awarded  Nice Answer
Aug
12
answered Measures on Young tableaux
Aug
2
comment An inequality for the ratio of standard Young tableau with {1,2,…,k} in the first row
I think Suvrit means this question: mathoverflow.net/q/65194/658
Aug
1
revised almost diagonal Positive semidefinite Matrix
deleted 68 characters in body
Jul
31
answered almost diagonal Positive semidefinite Matrix
Jul
25
awarded  Necromancer
Jul
25
answered Majorization and Schur Polynomials
May
15
answered About adding a negative definite rank-1 matrix to a symmetric matrix
May
12
comment Expected number of vertices of a hypercube slice — is this new/interesting?
Maybe check out the following papers; from a quick glance they seem like they might be relevant: ......... cs.columbia.edu/~rocco/Public/chow-journal3b.pdf .........and.......... [Goldberg '06]: "A Bound on the Precision Required to Estimate a Boolean Perceptron from its Average Satisfying Assignment"