Displaying similar documents to “On modular computation of standard basis.”

An algorithm for primary decomposition in polynomial rings over the integers

Gerhard Pfister, Afshan Sadiq, Stefan Steidel (2011)

Open Mathematics

Similarity:

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article. ...

Border bases and kernels of homomorphisms and of derivations

Janusz Zieliński (2010)

Open Mathematics

Similarity:

Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations. ...

Aspects of unconditionality of bases in spaces of compact operators

James R. Holub (1998)

Annales Polonici Mathematici

Similarity:

E. Tutaj has introduced classes of Schauder bases termed "unconditional-like" (UL) and "unconditional-like*" (UL*) whose intersection is the class of unconditional bases. In view of this association with unconditional bases, it is interesting to note that there exist Banach spaces which have no unconditional basis and yet have a basis of one of these two types (e.g., the space 𝓞[0,1]). In the same spirit, we show in this paper that the space of all compact operators on a reflexive Banach...