einbandi
Reputation
2,228
Next privilege 2,500 Rep.
Create tag synonyms
 Oct23 comment Given f[1] … f[k], k = 1, 2, 3… how do one find the general function f[n]? @ShutaoTang I quickly scrambled it together in inkscape, but with some effort it could be done more beautifully in LaTeX. Jul31 comment Given f[1] … f[k], k = 1, 2, 3… how do one find the general function f[n]? @Mr.Wizard Thanks for the edit! I knew someone would come up with a more concise way to code it. I'm not surprised it's you! :) May8 comment How to create an inverse pole figure color map Sadly I don't have any further information. At the moment, your visual reproduction is absolutely sufficient, thanks a lot! If I ever find out more about the color map, I'll add that information to the question. Jun25 comment FrameStyle in Inset with Framed expression Thanks! With your solution I finally get the desired output, even in the PDF. It's a shame that there seems to be no simple way for such a simple problem... Jun25 comment FrameStyle in Inset with Framed expression I like the idea of this answer, but I just can't get it to work properly. The thinnest frame I can get is exactly as thick as the one using FrameStyle or BoxFrame (which looks like 1 pt in the resulting PDF). Jun21 comment FrameStyle in Inset with Framed expression Could you provide an example of that? Jun4 comment How do I generate a table of data points from a function and add random noise? This might get you started: foo = Interpolation@Table[{x, RandomReal[{-0.2,0.2}]}, {x, -5, 5, 0.01}]; Plot[ Sin[x] + foo[x], {x, -5, 5}] Apr9 comment Composing an image with a plot @YvesKlett the new version comes with alpha channels. Thanks for the link, btw. It's really useful! :) Apr9 comment Composing an image with a plot @Szabolcs I just read your comment after I did exactly that for my answer. :) Apr8 comment Efficiently filling area with disks located at certain points @rm -rf wouldn't that relocate the disks to form a more tightly packed area? I'd like the disks' positions to be fixed at the starting points, if possible. Apr6 comment Transform fancy usage messages in 1D string @halirutan Please have a look at the updated code. (Vll kann man damit ja mehr anfangen :)) Mar27 comment How to determine all cases consistent with constraints (+1)Maybe you could add how to put in the constraint? Or maybe how to generalise this for more variables? Then this could be an even more useful answer. Mar22 comment Faster way to convert triangle list to edge list with no duplicates Yup, I removed the redundant Sort. Mar22 comment Faster way to convert triangle list to edge list with no duplicates btw, looking at your timing results, I should consider buying a new computer :) Mar22 comment Faster way to convert triangle list to edge list with no duplicates Funny. :) It's basically the first approach that I tried. I don't really know a lot about Compile though, so I just left it as it is. And it looks quite nice and clean in my opinion. Mar17 comment How to construct pairs in a list? f[num_Integer] := Union[Partition[#, 2] & /@ Permutations[Range@num], SameTest -> (Sort[Sort /@ #1] == Sort[Sort /@ #2] &)] Mar15 comment How to construct pairs in a list? Please take a look at the edited post. I have made the solution more general to include single terms such as your example x[1]^2. Mar7 comment Enforcing correct variable bindings and avoiding renamings for conflicting variables in nested scoping constructs That's totally fine with me. In fact I'm glad that this question turned out to be of this much interest and spawned such a nice and thorough answer. Thank you! Mar6 comment Enforcing correct variable bindings and avoiding renamings for conflicting variables in nested scoping constructs Thanks! This is clean and easy. I knew I was missing something here... Mar6 comment How do I create a matrix of functions? I was rather thinking of a way that really returns a Function object. Now that I'm interested in it, I might actually write up a seperate question.