Defactoring algorithms: Difference between revisions
Cmloegcmluin (talk | contribs) VEA → EA |
Cmloegcmluin (talk | contribs) add historical motivation stuff back |
||
| Line 1: | Line 1: | ||
This article discusses how to identify enfactoring and then defactor it. | This article discusses how to identify enfactoring and then defactor it. | ||
A major use case for defactoring is to enable a [[canonical form]] for temperament mappings, 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 minor determinants AKA 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. | |||
= Identifying enfactored mappings = | = Identifying enfactored mappings = | ||