2,438 reputation
826
bio website mathematics-diary.blogspot.co…
location Rotterdam
age
visits member for 2 years, 8 months
seen Aug 16 at 20:14

Software engineer Java / Android

http://www.facebook.com/graphica2

http://klic-app.nl/

Screenshot Graphica 0.7.0A DEV X6 30/8-'12

?


Sep
24
awarded  Autobiographer
Jul
21
awarded  Notable Question
Jul
2
awarded  Inquisitive
Jul
2
awarded  Curious
Apr
15
awarded  Good Question
Jan
22
accepted Has Mathematica a function to compute the Smith Normal Form?
Jan
22
comment Has Mathematica a function to compute the Smith Normal Form?
Coded in 1994 and it still works in Mathematica 9, that's how it should be.
Jan
22
asked Has Mathematica a function to compute the Smith Normal Form?
Jan
18
awarded  Yearling
Jan
13
awarded  Favorite Question
Nov
23
comment How to insert / merge a list into another list?
It is much faster than my previous ( but more beautiful ) choice: insertSeqA[x_, y_, n_] := FlattenAt[Insert[x, y, n], n]; insertSeqB[x_, y_, n_] := Join[x[[1 ;; n - 1]], y, x[[n ;; -1]]] Timing[insertSeqA[Flatten[Array[{#1, #2} &, {1000, 1000}], 1], Flatten[Array[{#1, #2} &, {100, 100}], 1], 1000];] Timing[insertSeqB[Flatten[Array[{#1, #2} &, {1000, 1000}], 1], Flatten[Array[{#1, #2} &, {100, 100}], 1], 1000];]
Nov
23
comment How to insert / merge a list into another list?
I did not know about the function FlattenAt, I like the third option. ( Imagine I hadn't asked the question. )
Nov
23
comment How to insert / merge a list into another list?
I made an error, but have edited it, sorry.
Nov
23
asked How to insert / merge a list into another list?
Nov
23
accepted How to find the longest matching sublists in a list
Nov
16
comment How to find the longest matching sublists in a list
So far, so good, thanks
Nov
16
revised How to find the longest matching sublists in a list
added 408 characters in body
Nov
16
comment How to find the longest matching sublists in a list
Now it fails on this list: {{0, 0}, {1, 0}, {1, 1}, {0, 1}, {2, 0}, {3, 0}, {3, 1}, {2, 1}, {1, 0}, {1, 1}, {4, 0}, {0, 0}, {1, 0}, {1, 1}, {0, 1}, {2, 0}, {3, 0}, {3, 1}, {2, 1}, {1, 0}, {2, 1}, {4, 0}};
Nov
16
comment How to find the longest matching sublists in a list
This list should return {} but fails on the solution you gave: {{Sqrt[3]/2, 1/2}, {0, 1}, {-(Sqrt[3]/2), 1/ 2}, {-(Sqrt[3]/2), -(1/2)}, {0, -1}, {Sqrt[3]/ 2, -(1/2)}, {-(Sqrt[3]/2), 1/2}, {0, 1}, {-(1/2), 1/2 (2 + Sqrt[3])}, {1/2 (-1 - Sqrt[3]), 1/2 (1 + Sqrt[3])}, {-(1/2), 1/2 (2 + Sqrt[3])}, {0, 1}, {1/2, 1/2 (2 + Sqrt[3])}, {1/2, 1/2 (2 + Sqrt[3])}, {0, 1}, {Sqrt[3]/2, 1/ 2}, {1/2 (1 + Sqrt[3]), 1/2 (1 + Sqrt[3])}, {1/2 (1 + Sqrt[3]), 1/2 (1 + Sqrt[3])}, {Sqrt[3]/2, 1/2}, {1/2 (2 + Sqrt[3]), 1/2}}
Nov
16
comment How to find the longest matching sublists in a list
Ok, I mean {1,0}={1,0} and {1,1}={1,1} .