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 8 of 8 for “"Groebner Basis"”.
-
Integer Programming With Groebner Basis
… solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso …
-
An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation
… to Buchberger's original algorithm for Groebner basis computation including the Gebauer-Moeller Criteria, the "Sugar" strategy, and Jean-Charles Faugere's F4 algorithm. Since Faugere's F4 is generally accepted as being a particularly efficient approach to Groebner basis computation, we …
-
Computational Algebraic Geometry Applied to Invariant Theory
… is drawn from a modern standpoint. The Hilbert Basis Theorem and the Nullstellenstatz were considered lemmas for classical invariant theory. The Groebner basis is a modern tool used and is implemented with the computer algebra system Mathematica. Number 14 of Hilbert\'s 23 problems is discussed …
-
On Groebner Bases of (Non)commutative Free Algebras
… structure called ideals. The theory of Groebner bases provide a theoretical foundation for answering questions involving ideals. The original algorithm used to produce a Groebner basis was developed in 1976 by Buchberger. It has been implemented in many computer algebra systems. In a …
-
An Algebraic Approach to Reverse Engineering with an Application to Biochemical Networks
… method uses algorithmic tools, including Groebner-basis techniques, to build the set of all discrete models that fit time series data and to select minimal models from this set. The models used in this work are discrete-time finite dynamical systems, which, when defined over a finite …
-
Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems
… (over finite fields) that have infinite reduced Groebner bases, and can be used to generate a public key. We present classes of such ideals and prove that they do not have a finite Groebner basis under any admissible order. We also examine various techniques to realize finite Groebner bases, in …
-
Groebner Finite Path Algebras
… of their finitely generated ideals have finite Groebner bases.
-
Automatización e implementación de algunos problemas algebráicos y geométricos
… de métodos algebraicos (método de las bases de Groebner y método de seudodivisiones de Wu) a la automatización de un criterio de no-ramificación de ideales primos en extensiones algebraicas y a la demostración automática de un teorema original de Geometría Sintética. El objetivo de los tres …