pith. sign in

arxiv: 1012.1190 · v1 · pith:IEBUNNTHnew · submitted 2010-12-06 · 🧮 math.AC · math.AG

An improvement upon unmixed decomposition of an algebraic variety

classification 🧮 math.AC math.AG
keywords algebraicvarietycomputationdecompositiongeometrymathbbunmixedalgorithms
0
0 comments X
read the original abstract

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and developed efficient algorithms using $Gr$\"{o}$bner$ basis method. In this paper, we try to modify the computation of unmixed decomposition of an algebraic variety based on improving the computation of $Zero(sat(\mathbb{T}))$, where $\mathbb{T}$ is a triangular set in $\textbf{K[X]}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.