Reputation
1,015
Top tag
Next privilege 2,000 Rep.
 Mar 11 comment Reuse symbolic polynomial @JasonB: Ok, I'll go for that then. Was thinking there was a cleaner way to do it , but I guess not. Mar 11 comment Reuse symbolic polynomial @JasonB: Simply substituting. That's exactly what happens. But different params give different polynomials. Mar 8 comment Change of basis of polynomials @DanielLichtblau: The problem I have is not really doing the change of basis, I know how to do that, the problem I have is how to package it in a user-friendly manner that also allows for efficient memoization. Feb 26 comment Solving large linear systems of equations efficiently? @Kagaratsch: it just reminded me of a problem i had with similar complexity.. Feb 25 comment Solving large linear systems of equations efficiently? What are you doing exactly? Computing structure constants for different bases in representation theory? Feb 5 comment How to generate two group of $n$ random numbers in $U(0,1)$ such that sum of these two groups equal? @Szabolcs: Well, they CAN both be uniformly distributed and equal, taking $u_i=v_{\pi(i)}$, for some permutation $\pi$, but then they are of course not independent. Dec 1 comment Is Mathematica worth it for me? I started with Mathematica when I was 13. However, a Ti-83 will be more useful, I got one around that time, and that is how I learned programming and more math. Nov 19 comment Refining subset relations @AntonAntonov: You are right! That's a nice interpretation.. well, then this also means that the problem is NP-hard... Nov 18 comment Refining subset relations @AntonAntonov: Well, if the input uniquely defines all values, then the column-form output data you have is perfectly fine. But in a more general case, there must be some sort of disjoint set of equations that still span the same relations that was the input... Nov 18 comment Refining subset relations This is really a nice approach! Nov 17 comment Refining subset relations Hi Daniel! Yes, the typical input should be that each object gives exactly one value under the (unknown) map. Nov 13 comment Refining subset relations Ah, right! Ok, so I am looking for an efficient implementation, that exploits nice Mathematica constructs. That is, can my code above be improved? For example, my code iterates over the entire set of rules, and compares all pairs more or less. There should be some smarter way to exclude some cases, and/or exploit say singletons whose value is completely known. Nov 13 comment Refining subset relations @DanielLichtblau: Consider them as vectors in $R^3$ then. Nov 13 comment Refining subset relations Can people who vote to close please motivate? I wrote the question in a bit of a hurry, and I added my code now. It should now be more clear what I am asking for... Nov 12 comment Refining subset relations Well, it does not matter in the way the question is formulated. My point is, the objects could be anything, say permutations, or vectors, or something. The code should work for any statistic on objects into integers.. Oct 10 comment Why some alpha + Evaluate return Pod, some return only return an Entity? Just curious, What happened 2013 that made people so interested in Richard III? Sep 21 comment Is there an easy way to speed up this double summation in Mathematica You can memoize wavefunc. That should make it way quicker. Sep 6 comment Module, local variable Ah, yes, this is what I suspected. Thanks! Sep 6 comment Module, local variable That's strange, I just ran some code, in a similar fashion, where I have a dynamic i that flickers, with the same value, and increments slowly, so I am sure that the flickering is not due to speedy incrementation. Dec 15 comment how to get continuation of square matrices with periodic diagonal band automatically? This is quite a complex task, unless you specify what exact type of continuations you mean... You say periodic, so I would guess start by writing a peroid-finding function for lists...