Sciweavers

128 search results - page 1 / 26
» The efficient computation of Fourier transforms on the symme...
Sort
View
APPML
2010
112views more  APPML 2010»
13 years 5 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 5 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
SIAMCOMP
2008
80views more  SIAMCOMP 2008»
13 years 5 months ago
The Symmetric Group Defies Strong Fourier Sampling
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
Cristopher Moore, Alexander Russell, Leonard J. Sc...
TSP
2008
178views more  TSP 2008»
13 years 5 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....