Complete intersections in simplicial toric varieties (Q480659)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6378433
Language Label Description Also known as
default for all languages
No label defined
    English
    Complete intersections in simplicial toric varieties
    scientific article; zbMATH DE number 6378433

      Statements

      Complete intersections in simplicial toric varieties (English)
      0 references
      0 references
      0 references
      9 December 2014
      0 references
      Let \(K[x_1,\ldots,x_n]\) be the polynomial ring in \(n\) variables over a field \(K\). Denote by \({\mathbf x}^{\mathbf u}\) the monomial \(x_1^{u_1} \cdots x_n^{u_n}\) of \(K[x_1,\ldots,x_n]\) for \({\mathbf u}=(u_1,\ldots,u_n) \in \mathbb{N}^n\). Given a set \(\mathcal{A}=\{{\mathbf a}_1,\ldots,{\mathbf a}_n\}\) of nonzero vectors in \(\mathbb{N}^m\), the associated toric ideal \(I_{\mathcal{A}}\) is the kernel of the \(K\)-algebra homomorphism \(\phi: K[x_1,\ldots,x_n] \rightarrow K[t_1,\ldots,t_m]\) such that \(\phi(x_i)={\mathbf t}^{{\mathbf a}_i}\) for all \(i=1,\ldots,n\). The toric ideal \(I_{\mathcal{A}}\) is said to be simplicial toric ideal if the number of extremal rays of the cone spanned by \(\mathcal{A}\) is equal to the dimension of the \(\mathbb{Q}\)-vector space \(\mathbb{Q} \mathcal{A}\). In the article under review the authors provide an algorithm for checking whether \(I_{\mathcal{A}}\) is a complete intersection. For homogeneous simplicial toric ideals, they provide a simpler version of this algorithm. Finally, when \(K\) is an algebraically closed field, they list all ideal-theoretic complete intersection simplicial projective toric varieties that are either smooth or have one singular point.
      0 references
      complete intersection
      0 references
      simplicial toric ideal
      0 references
      singularities
      0 references
      algorithm
      0 references
      0 references
      0 references
      0 references

      Identifiers