57,615 reputation
7122450
bio website cs.smith.edu/~orourke
location Smith College, U.S.
age
visits member for 5 years, 2 months
seen 39 mins ago

Professor of Computer Science; Professor of Mathematics.


33m
awarded  Enlightened
13h
revised Counting subspaces
Fixed (I hope!) 4 LaTeX errors.
1d
revised Recent progress on the busy beaver problem?
Removed extra chars around image.
1d
revised Recent progress on the busy beaver problem?
Added Michel's paper.
1d
answered Recent progress on the busy beaver problem?
1d
comment Maximal opening angle of a polygon from a point
@shoosh: Yes. I elaborated along the same lines as you suggest.
1d
revised Maximal opening angle of a polygon from a point
Updated according to comments.
1d
comment Maximal opening angle of a polygon from a point
@GerhardPaseman: You are right, I assumed the polygon is given by its vertices in order (ccw or cw), as they would be from e.g., a convex hull algorithm. If the vertices are completely unordered, $\Omega(n \log n)$ is a lowerbound (in a comparison model).
1d
answered Maximal opening angle of a polygon from a point
2d
revised Possibility of Disconnected Subgraphs of a $k$ Connected $r$ regular Graph under a given condition
Cleaned up readability/formatting a bit (but not enough).
2d
accepted Transcendental distance sets
2d
comment Transcendental distance sets
Thank you, especially for the link to the $\frak{c}$-sized algebraically independent set of reals.
2d
asked Transcendental distance sets
Jul
26
awarded  Nice Answer
Jul
25
revised Computer calculations in a paper
Added excerpt from abstract.
Jul
25
comment Computer calculations in a paper
Hales has set a(n appropriately) high bar for us all.
Jul
25
revised Computer calculations in a paper
Clarified.
Jul
25
revised Computer calculations in a paper
Added link for cited paper.
Jul
25
answered Computer calculations in a paper
Jul
25
revised Does squaring a directed random graph more than double its out-degree?
BMcK's distinction between oriented and directed.