Computational bounds for doing harmonic analysis on permutation modules of finite groups

DOI10.1007/S00041-021-09886-3MaRDI QIDQ1982599zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 September 2021

Published in The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.03722

zbMATH Keywords

finite groupsharmonic analysispermutation modules

Mathematics Subject Classification ID

Harmonic analysis on homogeneous spaces (43A85) Numerical methods for discrete and fast Fourier transforms (65T50) Special aspects of infinite or finite groups (20F99) Computational methods for problems pertaining to group theory (20-08)

Abstract: We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express the resulting computational bounds. We conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids.

Recommendations

• Harmonic analysis on a finite homogeneous space II: The Gelfand–Tsetlin decomposition
• scientific article; zbMATH DE number 475357
• Harmonic analysis on a finite homogeneous space
• Permutation modules for the symmetric group
• scientific article; zbMATH DE number 96388

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3771876 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 53765 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1318047 (Why is no real title available?)
• scientific article; zbMATH DE number 475357 (Why is no real title available?)
• scientific article; zbMATH DE number 610966 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1004944 (Why is no real title available?)
• scientific article; zbMATH DE number 847276 (Why is no real title available?)
• A generalization of spectral analysis with application to ranked data
• Computing Irreducible Representations of Finite Groups
• Computing Isotypic Projections with the Lanczos Iteration
• Fast generalized Fourier transforms
• Harmonic analysis on finite groups. Representation theory, Gelfand pairs and Markov chains
• Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
• On the Evolution of Noncommutative Harmonic Analysis
• Representation theory of the symmetric group in voting theory and game theory
• Separation of variables and the computation of Fourier transforms on finite groups, I
• Separation of variables and the computation of Fourier transforms on finite groups. II
• The efficient computation of Fourier transforms on the symmetric group
• Voting, the symmetric group, and representation theory

Cited in

(1)

• A fast Fourier transform for the Johnson graph

This page was built for publication: Computational bounds for doing harmonic analysis on permutation modules of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982599)