Timeline for Multiplication partitioning into k distinct elements
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2018 at 12:45 | history | edited | Marko Riedel | CC BY-SA 4.0 | switch to ac notation |
| Apr 13, 2017 at 12:20 | history | edited | CommunityBot | replaced http://math.stackexchange.com/ with https://math.stackexchange.com/ | |
| Oct 30, 2015 at 17:20 | comment | added | Elliot Gorokhovsky | What's the complexity of this algorithm? | |
| Apr 25, 2015 at 20:50 | comment | added | Nicolás Siplis | Then I'm approaching my particular problem in the wrong way. Still though, your answer was really informative and helped me learn some more properties of combinatorics, so once again thank you! | |
| Apr 25, 2015 at 20:35 | comment | added | Marko Riedel | The factorization is not a determining factor here, rather it is the coefficient extraction from the $5604$ terms in the cycle index $Z(P_{30})$. Fine-tuning this would appear to be a thesis type project involving a considerable effort of optimization and innovative coding. | |
| Apr 25, 2015 at 16:00 | comment | added | Nicolás Siplis | Hmm, interesting. It seems this algorithm can compute large values of n but it becomes inefficient when k increases. For example, (10!,30) hogs a lot of memory and takes too long to finish. Are there any particular optimizations that could be made to calculate when k = 30 and n is a factorial? I'm assuming that, since calculating the divisors of a factorial is trivial, there's a significant speed improvement that can be made. | |
| Apr 25, 2015 at 0:20 | vote | accept | Nicolás Siplis | ||
| Apr 25, 2015 at 0:20 | history | edited | Marko Riedel | CC BY-SA 3.0 | fix typo |
| Apr 25, 2015 at 0:06 | history | edited | Marko Riedel | CC BY-SA 3.0 | grammar |
| Apr 24, 2015 at 23:58 | comment | added | Marko Riedel | I will certainly upvote a functional contribution in another language that would then confirm the results from the above post assuming I have not made any mistakes. | |
| Apr 24, 2015 at 23:50 | comment | added | Marko Riedel | Being a Linux user and programmer I strongly encourage translating these MAPLE routines for PET computations and making them available for anyone to use. (The link has contributions from a number of users.) | |
| Apr 24, 2015 at 23:44 | history | edited | Marko Riedel | CC BY-SA 3.0 | comparison with brute-force |
| Apr 24, 2015 at 23:43 | comment | added | Nicolás Siplis | Slightly overwhelming but I will study the code to see if I can translate it into another language, a million thanks! | |
| Apr 24, 2015 at 23:32 | history | edited | Marko Riedel | CC BY-SA 3.0 | pointer |
| Apr 24, 2015 at 23:18 | history | edited | Marko Riedel | CC BY-SA 3.0 | distinct factors, code |
| Apr 24, 2015 at 23:01 | history | edited | Marko Riedel | CC BY-SA 3.0 | distinct factors |
| Apr 24, 2015 at 22:54 | history | answered | Marko Riedel | CC BY-SA 3.0 |