2019
DOI: 10.1017/s0017089519000089
|View full text |Cite
|
Sign up to set email alerts
|

Solvable Crossed Product Algebras Revisited

Abstract: For any central simple algebra over a field F which contains a maximal subfield M with non-trivial automorphism group G = AutF (M ), G is solvable if and only if the algebra contains a finite chain of subalgebras which are generalized cyclic algebras over their centers (field extensions of F ) satisfying certain conditions. These subalgebras are related to a normal subseries of G. A crossed product algebra F is hence solvable if and only if it can be constructed out of such a finite chain of subalgebras. This … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…If G is solvable then A is called a solvable G-crossed product. In [9] we revisited a result by Albert [1] on solvable crossed products and gave a proof for Albert's result using generalized cyclic algebras following Petit's approach [17], proving that a G-crossed product is solvable if and only if it can be constructed as a chain of generalized cyclic algebras. Hence any solvable G-crossed product division algebra is always a generalized cyclic division algebra.…”
Section: Introductionmentioning
confidence: 99%
“…If G is solvable then A is called a solvable G-crossed product. In [9] we revisited a result by Albert [1] on solvable crossed products and gave a proof for Albert's result using generalized cyclic algebras following Petit's approach [17], proving that a G-crossed product is solvable if and only if it can be constructed as a chain of generalized cyclic algebras. Hence any solvable G-crossed product division algebra is always a generalized cyclic division algebra.…”
Section: Introductionmentioning
confidence: 99%