Results 1 
2 of
2
Dynamical Gröbner bases
 JOURNAL OF ALGEBRA
, 2006
"... In this paper, we introduce the notion of “dynamical Gröbner bases” of polynomial ideals over a principal ring. As application, we solve dynamically a fundamental algorithmic question in the theory of multivariate polynomials over the integers called “Kronecker’s problem,” that is the problem of fin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we introduce the notion of “dynamical Gröbner bases” of polynomial ideals over a principal ring. As application, we solve dynamically a fundamental algorithmic question in the theory of multivariate polynomials over the integers called “Kronecker’s problem,” that is the problem of finding a decision procedure for the ideal membership problem for Z[X1,...,Xn]. The notions of Gröbner bases over Noetherian valuation rings and dynamical Gröbner bases over principal rings have applications in error correcting codes.
Scetches and Specifications User'S Gude  First . . .
, 2000
"... SKETCHES AND SPECIFICATIONS is a common denomination for several papers which deal with applications of Ehresmann’s sketch theory to computer science. These papers can be considered as the first steps towards a unified theory for software engineering. However, their aim is not to advocate a unificat ..."
Abstract
 Add to MetaCart
SKETCHES AND SPECIFICATIONS is a common denomination for several papers which deal with applications of Ehresmann’s sketch theory to computer science. These papers can be considered as the first steps towards a unified theory for software engineering. However, their aim is not to advocate a unification of computer languages; they are designed to build a frame for the study of notions which arise from several areas in computer science. These papers are arranged in two complementary families: REFERENCE MANUAL and USER’S GUIDE. The reference manual provides general definitions and results, with comprehensive proofs. On the other hand, the user’s guide places emphasis on motivations and gives a detailed description of several examples. These two families, though complementary, can be read independently. No prerequisite is assumed; however, it can prove helpful to be familiar either with specification techniques in computer science or with category theory in mathematics. These papers are under development, they are, or will be, available at: