Multiplicative characters and the discrete Fourier transform (Q1819920)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3995015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicative characters and the discrete Fourier transform |
scientific article; zbMATH DE number 3995015 |
Statements
Multiplicative characters and the discrete Fourier transform (English)
0 references
1986
0 references
The paper is concerned with an analysis of multiplicative complexity of the discrete Fourier transform from a number theoretic point of view. Results from a paper of \textit{L. Auslander}, \textit{E. Feig} and \textit{S. Winograd} [Adv. Appl. Math. 5, 31-55 (1984; Zbl 0568.65095)] are reproved using the multiplicative characters theory.
0 references
ideal theory
0 references
local rings
0 references
periodic functions
0 references
multiplicative complexity
0 references
discrete Fourier transform
0 references
multiplicative characters theory
0 references
0.8937344
0 references
0.89167064
0 references
0.8857538
0 references
0 references
0 references
