1993
DOI: 10.1007/978-1-4612-0889-1
|View full text |Cite
|
Sign up to set email alerts
|

Noncommutative Algebra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
69
0

Year Published

1998
1998
2013
2013

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 88 publications
(71 citation statements)
references
References 2 publications
0
69
0
Order By: Relevance
“…Suppose now that G = S 8 , the symmetric group on eight letters, and let F be cyclic of order 8. Choose a generator c of F and define an action of F on G by the requirement that the action of c be the conjugation by the 8-cycle τ := (1,2,3,4,5,6,7,8), so that c.σ = τ στ −1 . Now, if g is the 8-cycle (1, 3, 5, 8, 2, 4, 6, 7 Suppose now that Λ [4,2] were central.…”
Section: 7mentioning
confidence: 99%
“…Suppose now that G = S 8 , the symmetric group on eight letters, and let F be cyclic of order 8. Choose a generator c of F and define an action of F on G by the requirement that the action of c be the conjugation by the 8-cycle τ := (1,2,3,4,5,6,7,8), so that c.σ = τ στ −1 . Now, if g is the 8-cycle (1, 3, 5, 8, 2, 4, 6, 7 Suppose now that Λ [4,2] were central.…”
Section: 7mentioning
confidence: 99%
“…Now, let Y be any complete set of inequivalent, irreducible matrix representations for CR n . A naive implementation of the Fourier transform on R n , i.e., computing (12) and (13) directly, gives…”
Section: Computational Complexitymentioning
confidence: 99%
“…Therefore its compact subsets are exactly its finite subsets. We are now in position to state Jacobson's density theorem (see [8] for a proof). …”
Section: Jacobson's Density Theoremmentioning
confidence: 99%