# A Generalization of the Katzman-Zhang Algorithm

**Authors:** Mehmet Yesil

arXiv: 1812.01900 · 2019-03-04

## TL;DR

This paper extends the Katzman-Zhang algorithm for special ideals from finite dimensional power series rings to finite dimensional polynomial rings, broadening its applicability in algebraic computations.

## Contribution

It generalizes the existing algorithm for special ideals from power series rings to polynomial rings, enhancing its utility in algebraic geometry and commutative algebra.

## Key findings

- Extended the Katzman-Zhang algorithm to polynomial rings.
- Proved the generalized algorithm's correctness and applicability.
- Broadened the class of rings where the algorithm can be used.

## Abstract

In this paper, we study the notion of special ideals. We generalize the results on those as well as the algorithm obtained for finite dimensional power series rings by Mordechai Katzman and Wenliang Zhang to finite dimensional polynomial rings.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.01900/full.md

## References

15 references — full list in the complete paper: https://tomesphere.com/paper/1812.01900/full.md

---
Source: https://tomesphere.com/paper/1812.01900