Carmen Sessa

The membership problem for unmixed polynomial ideals is solvable in single exponential time

Abstract Deciding membership for polynomial ideals represents a classical problem of computational commutative algebra which is exponential space hard. This means that the usual algorithms for the membership problem which are based on linear algebra techniques have doubly exponential sequential worst case complexity. We show that the membership problem has single exponential sequential and polynomial parallel complexity for unmixed ideals. More specific complexity results are given for the special cases of zero-dimensional and complete intersection ideals.

ANALYTIC FUNCTIONALS ANNIHILATED BY IDEALS

AbstractLet V be a n-dimensional Stein manifold, I be a closed ideal of holomorphic functions on V. It was proved by Roger Gay that, given an analytic functional T such that hT=0 (as a functional) for any h∈I, one can find some (n, n)_compactly supported current

The Adidactic Interaction with the Procedures of Peers in the Transition from Arithmetic to Algebra: A Milieu for the Emergence of New Questions

\tilde T

An Integral Criterion for the Equivalence of Plane Curves.

, such that

An effective residual criterion for the membership problem in C[z1,…,zn]

\tilde T(\varphi ) = 0

La ecuación lineal con dos variables

for any ϕ ∈Iɛ0,0(V) and T(h)=