Algorithm Search⌘K

Conceptcore

DFT matrix

Also called Fourier matrix, Vandermonde matrix of roots of unity.

The n-by-n Vandermonde matrix of powers of a primitive n-th root of unity; multiplying by it computes the DFT.

The n-by-n Vandermonde matrix of powers of a primitive n-th root of unity; multiplying by it computes the DFT.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • one source with a locator