Talk:Hodge dual: Difference between revisions
No edit summary |
|||
(One intermediate revision by the same user not shown) | |||
Line 7: | Line 7: | ||
:: Is Sintel talking to himself? -- [[User:VectorGraphics|VectorGraphics]] ([[User talk:VectorGraphics|talk]]) 21:36, 11 June 2025 (UTC) | :: Is Sintel talking to himself? -- [[User:VectorGraphics|VectorGraphics]] ([[User talk:VectorGraphics|talk]]) 21:36, 11 June 2025 (UTC) | ||
::: I'll have to since nobody else replied. – [[User:Sintel|Sintel🎏]] ([[User_talk:Sintel|talk]]) 21:48, 11 June 2025 (UTC) | |||
== Computation == | |||
Who came up with the algorithm given in the computation section? I can not find any reference to it online. I'm only familiar with the usual basis permutation sign approach. | |||
I checked for a number of low-dimensional cases that it does indeed give the correct result. | |||
I'd like a reference or explanation of how it works. | |||
– [[User:Sintel|Sintel🎏]] ([[User_talk:Sintel|talk]]) 21:48, 11 June 2025 (UTC) | |||
: I kind of understand it now, the key is to get a proper inversion count using triangular numbers. I still don't know where it comes from though. The explanation is a bit convoluted and not exactly relevant here, so preferably it would still just be a reference, I'll try to hunt down some literature. – [[User:Sintel|Sintel🎏]] ([[User_talk:Sintel|talk]]) 11:38, 13 June 2025 (UTC) |