11,521 reputation
11765
bio website
location Ste-Suzanne, France
age
visits member for 3 years, 2 months
seen yesterday

Feb
13
comment How can I stop Mathematica from re-arranging formulae in TraditionalForm?
reference.wolfram.com/language/tutorial/… and reference.wolfram.com/language/guide/… may be helpful.
Feb
13
revised How can I stop Mathematica from re-arranging formulae in TraditionalForm?
added 254 characters in body
Feb
13
answered How can I stop Mathematica from re-arranging formulae in TraditionalForm?
Feb
13
revised Drawing a Gradient Between Two Circular Arcs
deleted 1 character in body
Feb
13
revised Drawing a Gradient Between Two Circular Arcs
graphics objects
Feb
13
revised Drawing a Gradient Between Two Circular Arcs
added 382 characters in body
Feb
13
revised Drawing a Gradient Between Two Circular Arcs
deleted 53 characters in body
Feb
13
revised Drawing a Gradient Between Two Circular Arcs
deleted 53 characters in body
Feb
13
answered Drawing a Gradient Between Two Circular Arcs
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
Mr.Wizard You are indeed perceptive. Yes, I was.
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
+1 for using Union instead of Sort and Union
Feb
11
comment Automatically convert pairs of directed edges to an undirected edge?
Would you clarify how /. {{_[a_, b_], __} :> a <-> b, {x_} :> x} works? I don't fully understand _[a_, b_] but it seems to be an opaque variation of belisarius' Rule[a_,b_].
Feb
10
comment LinearModelFit[] of simulated data
One possible title: "How do I simulate raw data (with measurement error) from a known function?"
Feb
8
revised How to make a cylinder with bottom that shows hidden part of edge as dashed curve
added 138 characters in body
Feb
8
answered How to make a cylinder with bottom that shows hidden part of edge as dashed curve
Feb
8
comment Using GraphData to generate all directed graphs with n vertices
A generalization of your method for labeling: graphs[n_] := Module[{c, cb}, c = GraphData["Connected", n]; cb = GraphData[#, "EdgeRules"] & /@ c; Row[Column[GraphData[#, {"StandardName", "Image"}]] & /@ c, Spacer[10]]]
Feb
8
revised Using GraphData to generate all directed graphs with n vertices
added 181 characters in body
Feb
8
revised Using GraphData to generate all directed graphs with n vertices
added 37 characters in body
Feb
8
comment Using GraphData to generate all directed graphs with n vertices
+1 Nice use of graph names, "Connected", and isomorphism.
Feb
7
revised Using GraphData to generate all directed graphs with n vertices
added 537 characters in body