Defactoring algorithms: Difference between revisions
Since we have a "development" section, it'd be great to put the background there |
m Polish the intro |
||
| Line 1: | Line 1: | ||
This article discusses how to identify enfactoring and then [[defactoring|defactor]] it. | This article discusses how to identify [[enfactoring]] in [[regular temperament]] [[mapping]]s and then [[defactoring|defactor]] it. | ||
A major use case for defactoring is to enable a [[canonical form | A major use case for defactoring is to enable a [[canonical form]], or in other words, to achieve a unique ID for temperaments in the form of a matrix. Previously this was only available by using lists of largest possible minor determinants aka [[wedgie|wedge products of mapping rows]], which by virtue of reducing the information down to a single list of numbers, could be checked for enfactoring by simply checking the single row's GCD. | ||
== Heuristics == | == Heuristics == | ||