On arithmetical associated orders (Q1915696): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Werner Bley / rank
Normal rank
 
Property / author
 
Property / author: David J. Burns / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Thong Nguyen Quang Do / rank
Normal rank
 
Property / author
 
Property / author: Werner Bley / rank
 
Normal rank
Property / author
 
Property / author: David J. Burns / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Thong Nguyen Quang Do / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jnth.1996.0082 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050576750 / rank
 
Normal rank

Latest revision as of 20:22, 19 March 2024

scientific article
Language Label Description Also known as
English
On arithmetical associated orders
scientific article

    Statements

    On arithmetical associated orders (English)
    0 references
    5 August 1996
    0 references
    Let \(p\) be an odd prime, and \(L/K\) a totally ramified finite abelian extension of \(p\)-adic fields with Galois group \(G\). For each ideal \(I\) of the valuation ring of \(L\), the associated order \(\text{End}_{\mathbb{Q}_p [G]}(I)\) is an interesting invariant of the \(\mathbb{Z}_p [G]\)-structure of \(I\). The authors show that, unless \(G\) is cyclic, no such order can contain any idempotent of \(\mathbb{Q}_p [G]\) which does not already lie in \(\mathbb{Z}_p[G]\). This puts a strong restriction on the possible structures of these orders. An algorithm for computing associated orders is also described, and explicit examples are computed.
    0 references
    0 references
    totally ramified finite abelian extension of \(p\)-adic fields
    0 references
    associated order
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references