2000 character limit reached
An improvement upon unmixed decomposition of an algebraic variety
Published 6 Dec 2010 in math.AC and math.AG | (1012.1190v1)
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]}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.