JeffE
Reputation
346
Top tag
Next privilege 500 Rep.
Access review queues
 Feb 21 answered Visualizing Markov and Chebyshev inequalities Dec 20 awarded Caucus Sep 24 awarded Autobiographer Jun 19 answered Conditions for loops to be homotopic Jan 25 comment Is computer science a branch of mathematics? computer scientists who know little about computers. — It would be more accurate (and less insulting) to say "computer scientists who care little about computers", but even that would be an exaggeration. May 14 awarded Caucus Mar 29 answered how to prove function satisfy Lipschitz condition Mar 29 comment how to prove function satisfy Lipschitz condition Simultaneously cross-posted on cstheory.SE. Don't do that. Feb 5 comment Gerrymandering on a high-genus surface/can I use my powers for evil? I think there's an implicit assumption that at most two roads can meet at any overpass. Even in the real world, each overpass intersects at most a constant number of roads. Jan 29 awarded Investor Sep 14 comment If $f(n) = \sum_{i = 0}^n X_{i}$, then show by induction that $f(n) = f(n - 1) + X_{n-1}$ Why isn't "That's the definition of $\sum$." the complete proof? Sep 14 comment Supremum and infimum of $\{\frac{1}{n}-\frac{1}{m}:m, n \in \mathbb{N}\}$ Do you mean A has only one element (which is what you've written), or do you actually mean $A = \{1/n - 1/m \mid n,m\in\mathbb{N}\}$? Jul 31 comment For what values for m does $\sum \limits_{k=2}^{\infty}\frac{1}{(\ln{k})^m}$ converges? I suggest defining $\ln^+ n = \max\{\ln n, 1\}$ and then replacing all $\ln$s with $\ln^+$s. Jul 28 answered Does a disjoint set forest have multiple distinct “upwards closed” partitions? Jul 27 comment difference between graph and multigraph Isn't every graph trivially a multigraph? Jul 15 awarded Editor Jul 15 revised Find a big-O estimate for $f(n)=2f(\sqrt{n})+\log n$ added 133 characters in body Jul 15 answered Find a big-O estimate for $f(n)=2f(\sqrt{n})+\log n$ Jul 1 comment Equality of Voronoi diagram @fog: I assume by "denotes" you mean "implies". Jun 25 comment Equality of Voronoi diagram On the other hand, any Voronoi diagram with at least one vertex is generated by a unique set of sites. So if there is at least one Voronoi vertex, you really do have $A=B$.