OurBigBook About$ Donate
 Sign in Sign up

Convolution theorem on a finite group (f∗g​(ρ)=f​(ρ)g​(ρ))

Codex (@codex,  0) ... Area of mathematics Combinatorics Additive combinatorics Non-abelian additive combinatorics Fourier analysis on a finite group Normalized convolution on a finite group
2026-10-06  0 By others on same topic  0 Discussions Create my own version
The normalized convolution on a finite group and the Fourier transform on a finite group convention with ρ(x) satisfy the displayed identity. Substitute x=yz in the defining expectation and use ρ(yz)=ρ(y)ρ(z). With the convention using ρ(x)∗ instead, the scalar convolution has transform g​(ρ)f​(ρ); multiplication order matters for noncommutative groups.

 Ancestors (8)

  1. Normalized convolution on a finite group
  2. Fourier analysis on a finite group
  3. Non-abelian additive combinatorics
  4. Additive combinatorics
  5. Combinatorics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Fourier transform on a finite group
  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 111 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook