Reputation
12,674
Next tag badge:
88/100 score
17/20 answers
Badges
1 20 73
Newest
 Yearling
Impact
~169k people reached

Mar
29
comment RegionIntersection: Point or Line?
Technically, I suppose, a line with no length may be equivalent to a point. However, I would expect Mathematica to return it in its standard form. In the particular case I am working on, I am trying to count the number of times a line crosses another line. Of course there is a workaround, but it is a bit clumsy.
Mar
28
comment RegionIntersection: Point or Line?
Yes, I've used RegionIntersection in many other cases in which it returns a combination of Points and Lines
Mar
8
comment How to generate and draw simple bipartite graphs?
@Athanassios, It works for me with no problems. But I am using version 10. What version are you using?
Jan
18
comment Oddity with ToExpression
Jason B, It still seems to be a bug.
Dec
11
comment How can I define operators that have the behavior I want?
Doesn't Mathematica automatically simplify logic expressions? In this case Union[Intersection[a,b],b] should be automatically be simplified to b if a, b are sets. By the way, = is the assignment operator, Set; Equal is ==.
Oct
4
comment Converting imported data into a list of pairs
+1 Nothing fancy. Nice and clean.
Sep
18
comment Boolean value of proposition assuming previous boolean values of parts of the proposition
Patrick, Why don't you post your comment as a response? I wasn't aware that Simplify could make boolean inferences.
Sep
10
comment Circular Plot and Circular Histogram
I used 5 and 25 bins (i.e. sectors) as examples.
Aug
30
comment Calculating expected value from paired values and weights
+1 Nice, clear explanation.
Aug
30
comment Calculating expected value from paired values and weights
Very good point.
Aug
30
comment Calculating expected value from paired values and weights
+1 Interesting use of Dot. It would be nice if you provided an explanation of the code.
Aug
30
comment Calculating expected value from paired values and weights
Thanks for pointing this out.
Aug
30
comment Finding all shortest paths between two vertices
It should work with weighted edges. From the documentation on GraphDistance: "For a weighted graph, the distance is the minimum of the sum of weights along any path between s and t."
Jul
20
comment Is there a nice way to display big nested tables?
I don't see any nesting in your table. It looks like a simple table of graphs with an ID and what appears to be an average value. Are you seriously planning to show each of these graphs to your audience without putting them to sleep?
Jun
21
comment How convert list of numbers to list of points on x-axis?
You may easily combine Plot and NumberLinePlot. For example, Show[{ Plot[2 Sin[x] + x, {x, 0, 15}], NumberLinePlot[{2, 4, 7, 10, 13, 6}, Spacings -> 0]}]
May
31
comment Permuted Prime Numbers
FromDigits[Permutations[IntegerDigits[#]]] & /@ {113, 337, 199}
May
20
comment InfiniteLine Woes
@MarcoB, That's just what tripped me up. And I was in an unusual hurry too.
May
20
comment InfiniteLine Woes
Thanks. The syntax even matches that of Line. I'm surprised I didn't try it.
May
20
comment InfiniteLine Woes
What about this? (from the documentation) Graphics[InfiniteLine[{0, 0}, {1, 1}], Frame -> True]
Apr
23
comment Reconstruction of interrupted paths in images
ImageCorners reference.wolfram.com/language/ref/ImageCorners.html may be useful for step 1.