Talk:Generator preimage: Difference between revisions
Jump to navigation
Jump to search
m 1 revision imported: Moving archived Wikispaces discussion to subpage |
Cmloegcmluin (talk | contribs) →can anyone explain why the algorithm works?: new section |
||
| Line 1: | Line 1: | ||
{{WSArchiveLink}} | {{WSArchiveLink}} | ||
== can anyone explain why the algorithm works? == | |||
I'm the person who added the "example" section as well as the "Wolfram Language implementation" there, so I understand ''how'' to do it, but I have no real idea why it works. | |||
It's clear enough to me that the pseudoinverse step is how we convert the input mapping into generators. But then how do we "massage" those generators by combining them one at a time with the comma-basis, defactoring, dot-producting with the original row to get a thing we prepend before HNF'ing so that it has some effect on what remains when we grab that row back out...? It's quite tricksy. | |||
--[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 18:04, 6 October 2021 (UTC) | |||
Revision as of 18:04, 6 October 2021
|
This page also contains archived Wikispaces discussion. |
can anyone explain why the algorithm works?
I'm the person who added the "example" section as well as the "Wolfram Language implementation" there, so I understand how to do it, but I have no real idea why it works.
It's clear enough to me that the pseudoinverse step is how we convert the input mapping into generators. But then how do we "massage" those generators by combining them one at a time with the comma-basis, defactoring, dot-producting with the original row to get a thing we prepend before HNF'ing so that it has some effect on what remains when we grab that row back out...? It's quite tricksy.
--Cmloegcmluin (talk) 18:04, 6 October 2021 (UTC)