An algorithm for computing the number of intermediary rings in normal pairs (Q2456389)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for computing the number of intermediary rings in normal pairs |
scientific article |
Statements
An algorithm for computing the number of intermediary rings in normal pairs (English)
0 references
18 October 2007
0 references
Let \(R\) and \(S\) be two commutative rings with unit. The pair \((R,S)\) is said to be normal if \(R\subseteq S\) and each intermediate ring between \(R\) and \(S\) is integrally closed in \(S\). For instance, if \(R\) is a Prüfer domain with quotient field \(K\), then \((R,K)\) is a normal pair. The aim of this paper is to establish a formula for the number of intermediate rings between \(R\) and \(S\) when \((R,S)\) is a normal pair and the set \(\{p\in\operatorname{Spec}(R)\mid pS=S\}\) consists of finite trees.
0 references
normal pair
0 references
intermediate ring
0 references
Krull dimension
0 references
Prüfer domain
0 references
integral closure
0 references