Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

The F4-algorithm for Euclidean rings

100%
Sadiq A.
Open Mathematics
|
2010
|
tom 8
|
nr 6
1156-1159
EN
In this short note, we extend Faugére’s F4-algorithm for computing Gröbner bases to polynomial rings with coefficients in an Euclidean ring. Instead of successively reducing single S-polynomials as in Buchberger’s algorithm, the F4-algorithm is based on the simultaneous reduction of several polynomials.
2
Content available remote

Stanley depth of monomial ideals with small number of generators

100%
Cimpoeaş M.
Open Mathematics
|
2009
|
tom 7
|
nr 4
629-634
EN
For a monomial ideal I ⊂ S = K[x 1...,x n], we show that sdepth(S/I) ≥ n − g(I), where g(I) is the number of the minimal monomial generators of I. If I =νI′, where ν ∈ S is a monomial, then we see that sdepth(S/I) = sdepth(S/I′). We prove that if I is a monomial ideal I ⊂ S minimally generated by three monomials, then I and S/I satisfy the Stanley conjecture. Given a saturated monomial ideal I ⊂ K[x 1,x 2,x 3] we show that sdepth(I) = 2. As a consequence, sdepth(I) ≥ sdepth(K[x 1,x 2,x 3]//I) +1 for any monomial ideal in I ⊂ K[x 1,x 2,x 3].
3
Content available remote

Border bases and kernels of homomorphisms and of derivations

64%
Zieliński J.
Open Mathematics
|
2010
|
tom 8
|
nr 4
780-785
EN
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.
4
Content available remote

A procedure to compute prime filtration

64%
Rauf A.
Open Mathematics
|
2010
|
tom 8
|
nr 1
26-31
EN
Let K be a field, S = K[x 1, … x n] be a polynomial ring in n variables over K and I ⊂ S be an ideal. We give a procedure to compute a prime filtration of S/I. We proceed as in the classical case by constructing an ascending chain of ideals of S starting from I and ending at S. The procedure of this paper is developed and has been implemented in the computer algebra system Singular.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.