Displaying similar documents to “An algorithm for computing the kernel of a locally finite higher derivation up to a certain degree”

An algorithm to compute the kernel of a derivation up to a certain degree

Stefan Maubach (2001)

Annales Polonici Mathematici

Similarity:

An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.

Some results on the kernels of higher derivations on k[x,y] and k(x,y)

Norihiro Wada (2011)

Colloquium Mathematicae

Similarity:

Let k be a field and k[x,y] the polynomial ring in two variables over k. Let D be a higher k-derivation on k[x,y] and D̅ the extension of D on k(x,y). We prove that if the kernel of D is not equal to k, then the kernel of D̅ is equal to the quotient field of the kernel of D.

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

From Gentzen to Jaskowski and Back: Algorithmic Translation of Derivations Between the Two Main Systems of Natural Deduction

Jan von Plato (2017)

Bulletin of the Section of Logic

Similarity:

The way from linearly written derivations in natural deduction, introduced by Jaskowski and often used in textbooks, is a straightforward root-first translation. The other direction, instead, is tricky, because of the partially ordered assumption formulas in a tree that can get closed by the end of a derivation. An algorithm is defined that operates alternatively from the leaves and root of a derivation and solves the problem.