An algorithm for the Traverso-Swan theorem on seminormal rings (Q948720)

From MaRDI portal





scientific article; zbMATH DE number 5353584
Language Label Description Also known as
default for all languages
No label defined
    English
    An algorithm for the Traverso-Swan theorem on seminormal rings
    scientific article; zbMATH DE number 5353584

      Statements

      An algorithm for the Traverso-Swan theorem on seminormal rings (English)
      0 references
      0 references
      0 references
      17 October 2008
      0 references
      By Traverso-Swan's theorem a reduced ring \(A\) is seminormal if and only if the canonical map \(\text{Pic } A \rightarrow \text{Pic } A[x]\) is an isomorphism. The necessity could follow also from an algorithm presented in this paper. Let \(C\) be a reduced ring and \(f_1,\ldots, f_n\), \(g_1,\ldots, g_n\) polynomials in \(C[x]\) such that \(\sum_i f_ig_i=1\), \(f_1(0)=g_i(0)=1\), \(f_i(0)=g_i(0)=0\) for \(i>1\). Let \(A\) be the subring of \(C\) generated by the coefficients of the polynomials \(m_{ij}=f_ig_j\), \(1\leq i,j\leq n\) and \(B\) be the subring of \(C\) generated by the coefficients of the polynomials \(f_i,g_i\), \(1\leq i\leq n\). Then \(B\) is the seminormal closure of \(A\) in \(B\).
      0 references
      seminormal ring
      0 references
      Picard group
      0 references
      Constructive mathematics
      0 references
      Traverso-Swan theorem
      0 references
      Resultant ideal
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references