Search

There are several classical characterisations of the valuative dimension of a commutative ring. Constructive versions of this dimension have been given and proven to be equivalent to the classical notion within classical mathematics, and they can be used for the usual examples of commutative rings. To the contrary of the classical versions, the constructive versions have a clear computational content. This paper investigates the computational relationship between three possible constructive definitions of the valuative dimension of a commutative ring. In doing so, it proves these constructive versions to be equivalent within constructive mathematics. [ABSTRACT FROM AUTHOR]

Abstract: We give an algorithm for the well-known result asserting that if R is a polynomial ring in a finite number of variables over a Noetherian ring A of Krull dimension , then for , acts transitively on . For technical reasons we demand that the Noetherian ring A has a theory of Gröbner bases and contains an infinite set such that for each . The most important guiding examples are affine rings and localizations of polynomial rings , with K an infinite field. Moreover, we give an algorithmic proof of Suslin''s stability theorem over these rings. For the purpose to prepare the ground for this algorithmic generalizations of the Quillen–Suslin theorem (corresponding to the particular case A is a field), we will give in the first section a constructive proof of an important lemma of Suslin which is the only nonconstructive step in Suslin''s second elementary solution of Serre''s conjecture. This lemma says that for a commutative ring A, if where is monic and , then there exist such that . Thanks to this constructive proof, Suslin''s second proof of Serre''s conjecture becomes fully constructive. [Copyright &y& Elsevier]

Abstract: 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 . The notions of Gröbner bases over Noetherian valuation rings and dynamical Gröbner bases over principal rings have applications in error correcting codes. [Copyright &y& Elsevier]

We give an algorithm for computing the V -saturation of any finitely-generated submodule of V [ X 1 , … , X k ] m ( k ∈ N , m ∈ N ⁎ ), where V is a valuation domain. Our algorithm is based on a notion of “echelon form” which ensures its correctness. The proposed algorithm terminates when two (Hilbert) series on the quotient field and the residue field of V coincide. As application, our algorithm computes syzygies over V [ X 1 , … , X k ] . [ABSTRACT FROM AUTHOR]

Abstract: We constructively prove that for any ring R with Krull dimension ⩽d, the ring locally behaves like the ring or a localization of a polynomial ring of type with S a multiplicative subset of R such that the Krull dimension of is . As an application, we give a simple and constructive proof of the Lequain–Simis Induction Theorem which is an important variation of the Quillen Induction Theorem. [Copyright &y& Elsevier]