Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-08T01:59:11.326Z Has data issue: false hasContentIssue false
  • English
  • Français

Strong Gröbner bases for polynomials over a principal ideal ring

Published online by Cambridge University Press:  17 April 2009

Graham H. Norton  and
Ana Sǎlǎgean
Graham H. Norton
Affiliation:
Department of Mathematics, University of Queensland, Brisbane, Qld. 4072, Australia e-mail: [email protected] URL's: http://www.maths.uq.edu.au/~ghn
Ana Sǎlǎgean
Affiliation:
Department of computer Science, Loughborough University, Leicestershire LE11 3TU, United Kingdom e-mail: [email protected]://www.lboro.ac.uk/departments/co/personal_pages/salagean.html.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Gröbner bases, also known as D-bases. Several authors have shown that strong Gröbner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Gröbner bases and strong Gröbner bases when A is a principal ideal ring. We also give algorithms for computing Gröbner bases and strong Gröbner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Gröbner basis over a finite-chain ring, for example a Galois ring.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 64 , Issue 3 , December 2001 , pp. 505 - 528
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Adams, W. and Loustaunau, P., An Introduction to Gröbner bases, Graduate Studies in Mathematics 3 (American Mathematical Society, Providence R.I., 1994).Google Scholar
[2]Becker, T. and Weispfenning, V., Gröbner bases. A computational approach to commutative algebra, Graduate Texts in Mathematics 141 (Springer-Verlag, New York, 1993).Google Scholar
[3]Bosma, W., Cannon, J. and Playoust, C., ‘The Magma algebra system I: The user language’ J. Symbolic Comput. 24 (1997), 235–265.CrossRefGoogle Scholar
[4]Calderbank, A.R. and Sloane, N.J.A., ‘Modular and p-adic codes’, Des. Codes Cryptogr. 6 (1995), 21–35.CrossRefGoogle Scholar
[5]Faugère, J.-C., ‘A new efficient algorithm for computing Gröbner bases (F4)’, J. Pure Appl. Algebra 139 (1999), 61–88.CrossRefGoogle Scholar
[6]Gilmer, R., Multiplicative ideal theory, Pure and Applied Mathematics 12 (Marcel Dekker, Inc., New York, 1972).Google Scholar
[7]McDonald, B.R., Finite rings with identity (Marcel Dekker, Inc., New York, 1974).Google Scholar
[8]Norton, G.H. and Sǎlˇgean, A., ‘On the structure of linear and cyclic codes over finite chain rings’, Appl. Algebra Engrg. Comm. Comput. 10 (2000), 489–506.CrossRefGoogle Scholar
[9]Norton, G.H. and Sǎlǎgean, A., ‘Strong Gröbner bases and cyclic codes over a finite-chain ring’, workshop on coding and Cryptography, Paris 2001. Electronic Notes in Discrete Mathematics, 6 April 2001. http://www.elsevier.n1:80/inca/publications/store/5/0/5/6/0/9/.Google Scholar
[10]Zariski, O. and Samuel, P., Commutative algebra, Graduate Texts in Mathematics 28 (Springer-Verlag, Berlin, Heidelberg, New York, 1979).Google Scholar