Results 41 to 50 of about 250,418 (87)
A new algorithm for fast generalized DFTs
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie type, including ...
Hsu, Chloe Ching-Yun, Umans, Chris
core
On eigenvectors of nilpotent Lie algebras of linear operators
We give a condition ensuring that the operators in a nilpotent Lie algebra of linear operators on a finite dimensional vector space have a common eigenvector.Comment: Four ...
Hirsch, Morris W., Robbin, Joel W.
core
A new kind of polynomials for finite groups
Let Property X be a certain property of some finite groups; for instance, nilpotent, supersolvable, solvable et cetera. The Thompson-like problem asks whether for two finite groups G1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}
A. K. Asboei, C. Anabanti
semanticscholar +1 more source
A NOTE ON PRIMITIVE SUBGROUPS OF FINITE SOLVABLE GROUPS
Xuanli He, S. Qiao, Yanming Wang
semanticscholar +1 more source
Generating fast Fourier transforms of solvable groups
M. Clausen, Meinard Müller
semanticscholar +1 more source
A generalization of Hall-complementation in finite supersolvable groups
H. Bechtell
semanticscholar +1 more source
A theorem of Hall-Higman type for supersolvable groups
A. Turull
semanticscholar +1 more source

