Timeline for Computer platforms for combinatorial search problems/mathematical music theory?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2020 at 2:41 | comment | added | Noam D. Elkies | Do you really need roots of unity? In most packages it's easier to work with integers mod 12, and I think that in most instance of this kind of theory the integers mod 12 is all you need. | |
| Feb 2, 2020 at 0:27 | history | edited | YCor |
edited tags
|
|
| Sep 28, 2011 at 4:51 | history | edited | François G. Dorais |
edited tags
|
|
| Sep 13, 2011 at 7:00 | comment | added | Brendan McKay |
I don't know what you mean, since Maple can test for equality and disjointedness of sets easily, just use "set1 = set2" for equality and "set1 intersect set2={}" for disjointedness.
|
|
| Sep 13, 2011 at 6:48 | answer | added | Andrej Bauer | timeline score: 2 | |
| Sep 13, 2011 at 6:43 | answer | added | pbelmans | timeline score: 3 | |
| Sep 13, 2011 at 4:59 | comment | added | ARupinski | @David: Either way, programming checks for distinctness ends up very roundabout in Maple (as I recall solving my problem involved finding a way to convert the sets to some other data structure such as strings and then using some weird functions on strings to compare them. At any rate, it was a very difficult workaround that probably could have been avoided with a language better suited to comparing sets). | |
| Sep 13, 2011 at 4:12 | comment | added | David Feldman | @David White Supercollider is cool, but I think it's purpose built for audio synthesis, not combinatorial search, right? I'm sure it's Turing complete, but I'd be surprised if it offers tools that make my kind of problem easy. But I'd be happy to learn otherwise. | |
| Sep 13, 2011 at 4:09 | comment | added | David Feldman | @ARupinski I don't need distinct from a and b, just isometrically distinct from one another. | |
| Sep 13, 2011 at 3:59 | comment | added | ARupinski | I think I understand what you are trying to do; the tricky part seems to be checking whether the 24 permuted tetrachords are distinct from the originals. I recall I once had a similar problem that involved checking that two sets had empty intersection; although it turned out to be possible, it was extremely difficult to program this constraint in Maple. So although Maple should be able to handle this particular problem, I would not recommend using it (unless someone else knows a easy way of doing it). | |
| Sep 13, 2011 at 3:45 | comment | added | David White | Not sure if this can help or not, but my friends who like to compose music via mathematical pattern and computer algorithm are crazy for the programming language Supercollider. I guess it has a lot of features which both programmers and composers can get behind. Maybe it can also do something that would help you | |
| Sep 13, 2011 at 3:22 | history | asked | David Feldman | CC BY-SA 3.0 |