RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2020 Volume 498, Pages 64–74 (Mi znsl7036)

This article is cited in 1 paper

I

Subexponential-time computation of isolated primary components of a polynomial ideal

A. L. Chistov

St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences

Abstract: We suggest an algorithm for constructing all the isolated primary components of a given polynomial ideal. At the output, they are determined by systems of generators up to embedded components, and also as kernels of some homomorphisms. The complexity of this algorithm is subexponential in the size of the input data.

Key words and phrases: formal power series, fractional power series, nonzero characteristic, Newton–Puiseux algorithm, estimations of irreducible factors.

UDC: 513.6, 518.5

Received: 31.08.2020



© Steklov Math. Inst. of RAS, 2024