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 23 for “"Grobner bases"”.

  1. 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)

  2. Grobner Bases with Applications in Graph Theory

    Grobner basis theory has been applied to the problem of graph coloring with novel results. A graph on n vertices is represented by a polynomial in n variables with degree equal to the number of edges in the graph. In the polynomial ring in n variables, the question of k-colorability is equivalent …

    maryland Repository record for Grobner Bases with Applications in Graph Theory (opens in a new tab)

  3. Grobner Bases: Degree Bounds and Generic Ideals

    … degree bounds for general ideals and Gröbner bases structure for generic ideals. We start by giving an introduction to Gröbner bases and their basic properties and presenting a recent algorithm by Gao, Volny and Wang. Next, we survey degree bounds for the ideal membership problem, the …

    clemson Repository record for Grobner Bases: Degree Bounds and Generic Ideals (opens in a new tab)

  4. Grobner bases via linkage for classes of generalized determinantal ideals

    Grobner bases are an important tool for working with ideals in polynomial rings. They have both computational and theoretical importance. In this dissertation, we produce Grobner bases for some families of generalized determinantal ideals. Our main contribution is a Grobner basis for Schubert patch …

    sask Repository record for Grobner bases via linkage for classes of generalized determinantal ideals (opens in a new tab)

  5. Gröbner bases with an application to tame functions

    Grobner bases are essential tools in algebraic geometry, used to simplify and solve systems of polynomial equations. These bases revolutionized computational methods in various branches of mathematics after being introduced in 1965 by Bruno Buchberger. This thesis explores the foundational concepts …

    unf Repository record for Gröbner bases with an application to tame functions (opens in a new tab) Download PDF for Gröbner bases with an application to tame functions (opens in a new tab)

  6. Gröbner basis theory and its applications for regular and biregular functions

    This paper covers basic theory of Grobner Bases and an algebraic analysis of the linear constant coefficient partial differential operators, specifically the Cauchy-Fueter operator. We will review examples and theory of regular and biregular functions in several quaternionic variables.

    texas Repository record for Gröbner basis theory and its applications for regular and biregular functions (opens in a new tab)

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

  8. Problems in computational algebra and integer programming

    … in this thesis include the theory of polyhedra, Grobner bases, and computational complexity theory.

    washington Repository record for Problems in computational algebra and integer programming (opens in a new tab)

  9. Polynomial Identities and Enveloping Algebras for n-ary Structures

    … for universal envelopes using noncommutative Grobner bases. We provide computational evidence that the construction is much more difficult for n odd. Thirdly, we construct universal associative envelopes for the non-associative triple systems arising from trilinear operations applied to the …

    sask Repository record for Polynomial Identities and Enveloping Algebras for n-ary Structures (opens in a new tab)

  10. Computing syzygies of homogeneous polynomials using linear algebra

    … by Buchberger's algorithm for computing Gröbner Bases. However, Gröbner bases have been computationally impractical as the number of variables and number of polynomials increase. The aim of this thesis is to describe a way to compute syzygies without the need for Grobner bases but still retrieve …

    colostate Repository record for Computing syzygies of homogeneous polynomials using linear algebra (opens in a new tab)

  11. The Combinatorics And Geometry Of The Orbits Of The Symplectic Group On Flags In Complex Affine Space

    … combi¨ natorics of S n , the flag manifold, and Grobner bases. In chapter 3 we describe the orbits of B[-] x S pn on full rank 2n x 2n matrices (equivalent to the orbits of S pn on F lC2n ) by mapping those orbits to orbits of B[-] x B+ via M [RIGHTWARDS ARROW] MJM T using [RS90] and then …

    cornell Repository record for The Combinatorics And Geometry Of The Orbits Of The Symplectic Group On Flags In Complex Affine Space (opens in a new tab)

  12. Geometric optimal control with an application to imaging in nuclear magnetic resonance

    … occurring in physical experiments. Additionally, Grobner bases are employed to make an algebraic-geometric classification of the equilibrium and singular points of the exceptional dynamics.

    hawaii Repository record for Geometric optimal control with an application to imaging in nuclear magnetic resonance (opens in a new tab)

  13. 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 exist.E. …

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

  14. 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)

  15. Mathematical models of cell signalling in heterogeneous populations

    … model, making use of algebraic tools, such as Grobner bases, analytic expressions for the amplitude and the EC50 are computed. Such expressions allow one to identify precisely how a cell's response depends on the receptor core structure, namely receptor chain copy numbers and receptor …

    whiterose Download PDF for Mathematical models of cell signalling in heterogeneous populations (opens in a new tab)

  16. New techniques for digital filter design

    … examined by Souto is revisited, and the use of Grobner bases from computational algebraic geometry for this problem is described.

    rice Repository record for New techniques for digital filter design (opens in a new tab)

  17. The projective geometry of curves of genus one, and an algorithm for the Jacobian of such a curve

    … relies on techniques from the theory of Grobner bases, and on techniques from the invariant theory of finite groups. In presenting the background material to our algorithm, we develop the theory of curves of genus 1 with an attached k-rational divisor class, and the theory of …

    arizona-thes Repository record for The projective geometry of curves of genus one, and an algorithm for the Jacobian of such a curve (opens in a new tab)

Page 1 of 2