bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 3 months |
seen | Jul 16 at 10:58 | |
stats | profile views | 993 |
I'm a mathematician currently working in informatics, and at the same time a grad student researching graph theory.
Jun 28 |
comment |
Awfully sophisticated proof for simple facts
@MichaelBlackmon: Do you have a reference for that claim? This would give me a proof of the corollary that I'm an algebraist. |
Jun 26 |
awarded | Announcer |
Jun 24 |
comment |
What introductory book on Graph Theory would you recommend?
See also a more specific question with this answer: mathoverflow.net/a/95565/5340 |
Jun 24 |
comment |
Demonstrating that rigour is important
I guess this was in the 20th century. These days you can check quickly with a computer that the sum of the first five million primes is already over pi. |
Jun 24 |
comment |
Demonstrating that rigour is important
@BlueRaja: yes, but the calculator will be dead long before that point happens. |
Jun 24 |
revised |
Large bicliques in r-partite graphs containing no independent sets having one vertex from each class
add ramsey-theory tag |
Jun 24 |
suggested | approved edit on Large bicliques in r-partite graphs containing no independent sets having one vertex from each class |
Apr 27 |
revised |
Computionally efficient vertex enumeration for (convex) polytopes
add tag [computational-geometry] |
Apr 27 |
suggested | approved edit on Computionally efficient vertex enumeration for (convex) polytopes |
Apr 27 |
comment |
Computionally efficient vertex enumeration for (convex) polytopes
How is the polytope defined? Is it given as an intersection of half-planes? If so, can this problem be transformed to the dual problem of enumerating all the facets of the convex hull if the vertices are given? |
Apr 24 |
comment |
Minimum number of real multiplications to multiply two quaternions
Also cross-posted to Theoretical Computer Science: cstheory.stackexchange.com/q/31251/8067 |
Apr 14 |
answered | What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs? |
Apr 14 |
comment |
Open problems in Euclidean geometry?
This has also been asked as a question on our site: mathoverflow.net/q/20558/5340 What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs? |
Apr 14 |
answered | Open problems in Euclidean geometry? |
Apr 13 |
awarded | Yearling |
Apr 13 |
answered | Is every graph an edge-crossing graph? |
Mar 21 |
comment |
Mathematical habits of thought and action which would be of use to non-mathematicians
So as a mathematician, I should be paid more if I get fatter? See the recent Dilbert strips: dilbert.com/series/63 |
Mar 19 |
comment |
Too old for advanced mathematics?
You may consider asking this question on Mathematics Educators SE (which is a new site that didn't exist yet when you posted this), as matheducators.stackexchange.com/help/on-topic indicates questions about learning mathematics are on-topic there. |
Mar 16 |
comment |
Time for Langton's ant to cover a “square” torus
In the pictures showing how often the ant appears on a square, could you give a legend for what color means what frequency? |
Feb 10 |
comment |
Correlation between two continuous-time stochastic processes
This question seems to general. Could you be more specific, like, give the particular processes you're interested in. |