Graded commutative algebra and related structures in Singular with applications

  • This thesis is devoted to constructive module theory of polynomial graded commutative algebras over a field. It treats the theory of Groebner bases (GB), standard bases (SB) and syzygies as well as algorithms and their implementations. Graded commutative algebras naturally unify exterior and commutative polynomial algebras. They are graded non-commutative, associative unital algebras over fields and may contain zero-divisors. In this thesis we try to make the most use out of _a priori_ knowledge about their characteristic (super-commutative) structure in developing direct symbolic methods, algorithms and implementations, which are intrinsic to graded commutative algebras and practically efficient. For our symbolic treatment we represent them as polynomial algebras and redefine the product rule in order to allow super-commutative structures and, in particular, to allow zero-divisors. Using this representation we give a nice characterization of a GB and an algorithm for its computation. We can also tackle central localizations of graded commutative algebras by allowing commutative variables to be _local_, generalizing Mora algorithm (in a similar fashion as G.M.Greuel and G.Pfister by allowing local or mixed monomial orderings) and working with SBs. In this general setting we prove a generalized Buchberger's criterion, which shows that syzygies of leading terms play the utmost important role in SB and syzygy module computations. Furthermore, we develop a variation of the La Scala-Stillman free resolution algorithm, which we can formulate particularly close to our implementation. On the implementation side we have further developed the Singular non-commutative subsystem Plural in order to allow polynomial arithmetic and more involved non-commutative basic Computer Algebra computations (e.g. S-polynomial, GB) to be easily implementable for specific algebras. At the moment graded commutative algebra-related algorithms are implemented in this framework. Benchmarks show that our new algorithms and implementation are practically efficient. The developed framework has a lot of applications in various branches of mathematics and theoretical physics. They include computation of sheaf cohomology, coordinate-free verification of affine geometry theorems and computation of cohomology rings of p-groups, which are partially described in this thesis.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Oleksandr Motsak
URN (permanent link):urn:nbn:de:hbz:386-kluedo-26479
Advisor:Gert-Martin Greuel
Document Type:Doctoral Thesis
Language of publication:English
Publication Date:2011/06/19
Year of Publication:2011
Publishing Institute:Technische Universität Kaiserslautern
Granting Institute:Technische Universität Kaiserslautern
Acceptance Date of the Thesis:2010/02/07
Tag:
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik
MSC-Classification (mathematics):13P10 Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
16W55 "Super" (or "skew") structure [See also 17A70, 17Bxx, 17C70] (For exterior algebras, see 15A75; for Clifford algebras, see 11E88, 15A66)
16Z05 Computational aspects of associative rings [See also 68W30]
68W30 Symbolic computation and algebraic computation [See also 11Yxx, 12Y05, 13Pxx, 14Qxx, 16Z05, 17-08, 33F10]

$Rev: 12793 $