An algorithm for computing the number of intermediary rings in normal pairs (Q2456389)

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.