Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Grobner Bases"”.

  1. APPROXIMATE GROBNER BASES A BACKWARDS APPROACH

    … thesis is to give a method for approximating the Grobner basis of an approximate polynomial system. The Grobner basis of a polynomial system is arguably the most fundamental object of exact computation polynomial algebra, as it answers many of the important questions of commutative algebra, such …

    uwo Repository record for APPROXIMATE GROBNER BASES A BACKWARDS APPROACH (opens in a new tab)

  2. Grobner Bases and Ideals of Points

    … this thesis is an introduction to the theory of Grobner bases. The concept of Grobner basis and construction of the Grobner basis by Buchberger's Algorithm, in which the notion of S-polynomials is introduced, and a few modified or improved versions of Grobner basis algorithm are reviewed in this …

    vcu Repository record for Grobner Bases and Ideals of Points (opens in a new tab)

  3. Spatial reasoning for computer aided design, manufacturing and process planning

    … algebraic geometry, this work maps properties of Grobner bases to the GCS/SF domain. The mapping allows to determine multiplicity of feasible scenarios, redundancy and consistency of constraints, and degrees of freedom of the entities involved. A compact and efficient formulation in terms of the …

    uiuc Repository record for Spatial reasoning for computer aided design, manufacturing and process planning (opens in a new tab)

  4. Admissible orders on quotients of the free associative algebra

    … conditions that allow for the construction of Grobner bases for A -modules. When A is commutative, a finite reduced Grobner basis for an A -module can always be obtained, but when A is not commutative this is not the case; in fact in many cases a Grobner basis theory for A may not even …

    unh-thes Repository record for Admissible orders on quotients of the free associative algebra (opens in a new tab)

  5. Verificación formal en ACL2 del algoritmo de Buchberger

    … theory about Buchberger's algorithm for Grobner bases computation in ACL2 in which: (1) Multivariate polynomial rings are formalized. This formalization is abstract: it encapsulates a coefficient ring which is used for the construction of polynomials and the verification of their …

    cadiz Repository record for Verificación formal en ACL2 del algoritmo de Buchberger (opens in a new tab)