A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Paper
Irreducible decomposition of polynomial ideals
Abstract
In this paper we present some algorithms for computing an irreducible decomposition of an ideal in a polynomial ring R = K[x1,..., xn] where K is an arbitrary effective field. © 2005 Elsevier Ltd. All rights reserved.
Related
Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Conference paper
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991