Reputation
23,430
Next tag badge:
184/100 score
17/20 answers
Badges
2 58 115
Newest
 Nice Answer
Impact
~356k people reached

Sep
30
awarded  Explainer
Sep
30
answered Graphics3D not rendering Ball as a filled object
Sep
27
comment Enumerating all connected graphs with 9 vertices
Should be faster if you use FindIsomorphism[g,g,All] on a Graph object. On my iPhone right now so I can't try it just now.
Sep
27
comment Fitting ellipse to 5 given points on the plane
@Jens My assumption is that the OP simply wants to add more points that are know to be on the same ellipse, rather than find a best fit.
Sep
27
comment Fitting ellipse to 5 given points on the plane
@user153012 If you'd like to plot more points in a list, say morePoints, simply add another Point primitive containing your list to the Epilog.
Sep
27
awarded  Nice Answer
Sep
27
comment Enumerating all connected graphs with 9 vertices
@EdenHarder I believe the Graph6 representation of a graph depends on the ordering of the vertices and, as such, is not unique so there's no reason to expect "HhcWJEA" to be on that list. Presumably, one of the automorphisms of your graph leads to your g6 code.
Sep
27
comment Plotting Semi-hollow spheres
In light of the post of @belisarius, I wonder if the answers here contributed significantly to your cover image? If so, attribution (which I don't see, but might have missed in the article) would be appropriate.
Sep
27
answered Fitting ellipse to 5 given points on the plane
Sep
27
comment Enumerating all connected graphs with 9 vertices
getConnG[7] in about 6 minutes.
Sep
27
comment Bifurcation diagrams for multiple equation systems
@belisarius I saw that question but was not quite able to figure a good way to approach it. At least, not given the kind of time I've got these days!
Sep
27
comment Enumerating all connected graphs with 9 vertices
I modified your code slightly so that getConnG[6] runs in 5 seconds as opposed to 30 seconds on my machine. The major point is that DeleteDuplicates has quadratic time complexity when using a user defined comparison function. Thus, breaking the list of graphs in smaller parts using the total number of edges helps a lot. Of course, DeleteDuplicates can run like $n\log(n)$, when the data is linearly ordered, but that's not generally possible with a user defined comparison function.
Sep
27
revised Enumerating all connected graphs with 9 vertices
added 98 characters in body
Sep
24
awarded  Autobiographer
Sep
24
comment What's wrong in FunctionPeriod?
I don't think this is a duplicate, as the other question predates FunctionPeriod. Also, while FunctionPeriod builds on the Periodic context, there are differences. I guess I'd say it's a bug but I doubt that it's a very high priority bug.
Sep
24
revised What's wrong in FunctionPeriod?
added 199 characters in body
Sep
24
answered What's wrong in FunctionPeriod?
Sep
23
comment Unable to compile to C
Works for me with 10.0.1 on Mac OSX. Did you recently update? What's your platform?
Sep
23
comment Combining many plots with Show produces wrong x-axis position and wrong filling
@rcollyer Yes, I think you're right. I guess my approach fixes the problem precisely because it forces the AxesOrgin to be the same throughout.
Sep
23
comment getting vertices in order from spanning tree
I get a sequence of errors of the form: Function::flpar: Parameter specification Append[vlist,#1] in Function[Append[vlist,#1],1] should be a symbol or a list of symbols. >> I guess this can be fixed using SetDelayed rather than Set.