On the public citation graph

Decomposing Monomial Representations of Solvable Groups

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-9458-7openalex-snapshot
Linear Representations of Finite Groups
inferredcites →https://doi.org/10.1007/978-94-011-2358-7_7openalex-snapshot
Fast Fourier transforms
inferredcites →https://doi.org/10.1007/bf00348431openalex-snapshot
Gauss and the history of the fast Fourier transform
inferredcites →https://doi.org/10.1007/bf01293597openalex-snapshot
Extensions of Irreducible Representations
inferredcites →https://doi.org/10.1007/bf01459500openalex-snapshot
Fourier transforms with respect to monomial representations
inferredcites →https://doi.org/10.1007/bf02510144openalex-snapshot
Double coset decompositions and computational harmonic analysis on groups
inferredcites →https://doi.org/10.1007/s002000050067openalex-snapshot
A Direct Proof of Minkwitz's Extension Theorem
inferredcites →https://doi.org/10.1016/0196-8858(84)90003-4openalex-snapshot
Abelian semi-simple algebras and algorithms for the Discrete Fourier Transform
inferredcites →https://doi.org/10.1016/0196-8858(90)90008-mopenalex-snapshot
Fast Fourier analysis for abelian group extensions
inferredcites →https://doi.org/10.1016/b978-0-12-146356-4.50006-7openalex-snapshot
The Representation Theory of Finite Groups
inferredcites →https://doi.org/10.1016/c2013-0-11702-3openalex-snapshot
Finite Permutation Groups
inferredcites →https://doi.org/10.1016/j.jsc.2002.06.005openalex-snapshot
Symmetry-based matrix factorization
inferredcites →https://doi.org/10.1016/j.jsc.2002.06.006openalex-snapshot
Generating fast Fourier transforms of solvable groups
inferredcites →https://doi.org/10.1090/dimacs/028/13openalex-snapshot
Generalized FFTs–A survey of some recent results
inferredcites →https://doi.org/10.1090/dimacs/028/19openalex-snapshot
Some applications of generalized FFTs
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1090/s0025-5718-1994-1226811-6openalex-snapshot
Computing Irreducible Representations of Supersolvable Groups
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1030655-4openalex-snapshot
Efficient Computation of the Fourier Transform on Finite Groups
inferredcites →https://doi.org/10.1090/s0894-0347-97-00219-1openalex-snapshot
Separation of variables and the computation of Fourier transforms on finite groups, I
inferredcites →https://doi.org/10.1109/78.942628openalex-snapshot
Automatic generation of fast discrete signal transforms
inferredcites →https://doi.org/10.1109/massp.1984.1162257openalex-snapshot
Gauss and the history of the fast fourier transform
inferredcites →https://doi.org/10.1145/511988.511990openalex-snapshot
Automatic derivation and implementation of signal processing algorithms
inferredcites →https://doi.org/10.1177/1094342004041291openalex-snapshot
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Alogorithms
inferredcites →https://doi.org/10.1201/9781420064827.ch11openalex-snapshot
Fast Fourier Transforms
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.
inferredcites →https://doi.org/10.2307/2315163openalex-snapshot
Representation Theory of Finite Groups.
inferredcites →https://doi.org/10.5860/choice.37-6316openalex-snapshot
Fourier analysis on finite groups and applications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00200-008-0077-xopenalex-snapshot
Algebraic signal processing theory: Cooley–Tukey type algorithms on the 2-D hexagonal spatial lattice
inferred← citeshttps://doi.org/10.1007/s00450-006-0008-7openalex-snapshot
Quantum algorithms: A survey of some recent results
inferred← citeshttps://doi.org/10.1007/s10208-023-09609-8openalex-snapshot
Symmetry and Invariant Bases in Finite Element Exterior Calculus
inferred← citeshttps://doi.org/10.1007/s10208-025-09697-8openalex-snapshot
Representations of the Symmetric Group are Decomposable in Polynomial Time
inferred← citeshttps://doi.org/10.1016/j.jsc.2002.06.005openalex-snapshot
Symmetry-based matrix factorization
inferred← citeshttps://doi.org/10.1016/j.jsc.2002.06.006openalex-snapshot
Generating fast Fourier transforms of solvable groups
inferred← citeshttps://doi.org/10.1063/1.2222080openalex-snapshot
Minimally disturbing Heisenberg–Weyl symmetric measurements using hard-core collisions of Schrödinger particles
inferred← citeshttps://doi.org/10.1109/78.942628openalex-snapshot
Automatic generation of fast discrete signal transforms
inferred← citeshttps://doi.org/10.1109/tit.2009.2016012openalex-snapshot
Symmetric Measurements Attaining the Accessible Information
inferred← citeshttps://doi.org/10.1109/tsp.2007.907919openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
inferred← citeshttps://doi.org/10.1109/tsp.2008.2006152openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
inferred← citeshttps://doi.org/10.1109/tsp.2008.925261openalex-snapshot
Algebraic Signal Processing Theory: Foundation and 1-D Time
inferred← citeshttps://doi.org/10.1109/tsp.2012.2186133openalex-snapshot
Algebraic Signal Processing Theory: 1-D Nearest Neighbor Models
inferred← citeshttps://doi.org/10.1137/09076920xopenalex-snapshot
Unified Embedded Parallel Finite Element Computations via Software-Based Fréchet Differentiation
inferred← citeshttps://doi.org/10.1137/100805777openalex-snapshot
Algebraic Signal Processing Theory: Cooley–Tukey-Type Algorithms for Polynomial Transforms Based on Induction
inferred← citeshttps://doi.org/10.1137/s009753970139272xopenalex-snapshot
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
inferred← citeshttps://doi.org/10.1145/511988.511990openalex-snapshot
Automatic derivation and implementation of signal processing algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09598openalex-snapshot
SymDPoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.