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 20 of 26 for “"Groebner Bases"”.

  1. Groebner Bases

    We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson's Lemma, closely following the proof in Cox, Little, and O'Shea's Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. We then provide a …

    mo-state Repository record for Groebner Bases (opens in a new tab)

  2. Ideals, varieties, and Groebner bases

    … polynomial equations we show how to construct a Groebner basis using Buchbergers Algorithm. Gröbner bases have very nice properties, e.g. they do give a unique remainder in the division algorithm. We use these bases to solve systems of polynomial quations in several variables and to determine …

    csusb Repository record for Ideals, varieties, and Groebner bases (opens in a new tab)

  3. Ideals, varieties, and Groebner bases

    … polynomial equations we show how to construct a Groebner basis using Buchbergers Algorithm. Gröbner bases have very nice properties, e.g. they do give a unique remainder in the division algorithm. We use these bases to solve systems of polynomial quations in several variables and to determine …

    csusb-retro Repository record for Ideals, varieties, and Groebner bases (opens in a new tab)

  4. Factoring Polynomials and Groebner Bases

    … how to compute deterministically new Gr'{o}bner bases from given G'{o}bner bases when new polynomials are added, with running time polynomial in the degree of the original ideals. Also, a new upper bound is given on the number of ring extensions needed for finding proper factors, improving on …

    clemson Repository record for Factoring Polynomials and Groebner Bases (opens in a new tab)

  5. New Algorithms for Computing Groebner Bases

    … thesis, we present new algorithms for computing Groebner bases. The first algorithm, G2V, is incremental in the same fashion as F5 and F5C. At a typical step, one is given a Groebner basis G for an ideal I and any polynomial g, and it is desired to compute a Groebner basis for the new ideal , …

    clemson Repository record for New Algorithms for Computing Groebner Bases (opens in a new tab)

  6. Algorithms and applications of comprehensive Groebner bases.

    … to algorithms used to generate comprehensive Groebner bases of Volker Weispfenning (7). Comprehensive Groebner bases are bases for ideals in the ring of polynomials in several variables whose coefficients are polynomials in several symbolic parameters over a given field. These bases have the …

    arizona-thes Repository record for Algorithms and applications of comprehensive Groebner bases. (opens in a new tab)

  7. 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 …

    vt Repository record for Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems (opens in a new tab)

  8. Software Specialization as Applied to Computational Algebra

    … of algebraic problems can be solved using Groebner bases, and computational commutative algebra is the branch of mathematics that focuses mainly on such problems. In this thesis we employ Buchberger's algorithm for finding Groebner bases by tailoring specialized instances of Buchberger's …

    mcmaster Repository record for Software Specialization as Applied to Computational Algebra (opens in a new tab)

  9. Galois Groups of Differential Equations and Representing Algebraic Sets

    … and, for the corresponding radical ideal, Groebner bases or triangular sets. In computing any of these representations, it can be helpful to have a degree bound on the polynomials they will feature based on the given differential equation. Feng gave such a bound for a Groebner basis for a …

    cuny-grad Repository record for Galois Groups of Differential Equations and Representing Algebraic Sets (opens in a new tab)

  10. Groebner Finite Path Algebras

    … of their finitely generated ideals have finite Groebner bases.

    vt Repository record for Groebner Finite Path Algebras (opens in a new tab)

  11. A Case Study of A Multithreaded Buchberger Normal Form Algorithm

    Groebner bases have many applications in mathematics, science, and engineering. This dissertation deals with the algorithmic aspects of computing these bases. The dissertation begins with a brief introduction of fundamental concepts about Groebner bases. Following this a discussion of various …

    arizona-thes Repository record for A Case Study of A Multithreaded Buchberger Normal Form Algorithm (opens in a new tab)

  12. Geometric theorem proving using the Groebner basis algorithm

    … Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the application of the Groebner Basis Algorithm to geometric problems.

    csusb Repository record for Geometric theorem proving using the Groebner basis algorithm (opens in a new tab)

  13. Geometric theorem proving using the Groebner basis algorithm

    … Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the application of the Groebner Basis Algorithm to geometric problems.

    csusb-retro Repository record for Geometric theorem proving using the Groebner basis algorithm (opens in a new tab)

  14. Computational Algebraic Geometry Applied to Invariant Theory

    … 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 along with the notion of invariance under a group action of GLn(C). Computational difficulties are …

    vt Repository record for Computational Algebraic Geometry Applied to Invariant Theory (opens in a new tab)

  15. Algebraic methods for the distance of cyclic codes

    … proofs of known bounds. Finally, we use Groebner bases to prove that the optimal root bound can be computed in finite time.

    trento Repository record for Algebraic methods for the distance of cyclic codes (opens in a new tab)

  16. A Survey of Attacks on Multivariate Cryptosystems

    … that are possible, including the method of Groebner bases, the XL method, and the recently announced method of Dixon resultants. Less general attack techniques also exist, such as MinRank attacks and differential analysis. These attacks lack the universality of the first three mentioned. In …

    waterloo Repository record for A Survey of Attacks on Multivariate Cryptosystems (opens in a new tab)

  17. An investigation on Integer Factorization applied to Public Key Cryptography

    … integer solutions, that can be found using Groebner Bases.

    trento Repository record for An investigation on Integer Factorization applied to Public Key Cryptography (opens in a new tab) Restricted access

Page 1 of 2