Irreducible decomposition of polynomial ideals

E. Fortuna; P. Gianni; B.M. Trager

doi:10.1016/j.jsc.2004.11.005

Journal of Symbolic Computation

Paper

01 Mar 2005

Irreducible decomposition of polynomial ideals

View publication

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.

Paper

Automated search method for AFM and profilers

Michael Ray, Yves C. Martin

Proceedings of SPIE - The International Society for Optical Engineering

Paper

A minimal descriptor of an ancestral recombinations graph

Laxmi Parida, Pier F. Palamara, et al.

BMC Bioinformatics

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

Paper

On the distance to the zero-set of a polynomial

Matthew A Grayson

Journal of Complexity

View all publications

Abstract

Related

Automated search method for AFM and profilers

A minimal descriptor of an ancestral recombinations graph

Bounds on the ergodic capacity of training-based multiple-antenna systems

On the distance to the zero-set of a polynomial