Home
Add
Get on Google Play
Home
> Edit
Add/Update Thesis
Title*
Author's Name*
Supervisor's Name
Abstract
The theory of standard bases in polynomial rings with coefficients in a ring A with respect to local orderings is developed. A is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in A. Then the generalization of Faug ́ere F4-algorithm for polynomial rings with coefficients in Euclidean rings is given. This algorithm computes successively a Gr ̈obner basis replacing the reduction of one single s-polynomial in Buchberger’s algorithm by the simultaneous reduction of several polynomials. And finally we present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and the idea of Shimoyama–Yokoyama resp. Eisenbud–Hunecke–Vasconcelos to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular.
Subject/Specialization
Language
Program
Faculty/Department's Name
Institute Name
Univeristy Type
Public
Private
Campus (if any)
Institute Affiliation Inforamtion (if any)
City where institute is located
Province
Country
Degree Starting Year
Degree Completion Year
Year of Viva Voce Exam
Thesis Completion Year
Thesis Status
Completed
Incomplete
Number of Pages
Urdu Keywords
English Keywords
Link
Select Category
Religious Studies
Social Sciences & Humanities
Science
Technology
Any other inforamtion you want to share such as Table of Contents, Conclusion.
Your email address*