Abstract
We show by an example that the number of reduction steps needed to compute a prefix Gröbner basis in a free monoid ring by interreduction can in fact be exponential in the size of the input. This answers an open question posed by Zeckzer in [Ze00].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, P., Kreuzer, M.: Gröbner Basis Cryptosystems. In: AAECC 17, pp. 173–194 (2006)
Madlener, K., Reinert, B.: On Gröbner Bases in Monoid and Group Rings. In: Proc. ISSAC’93, pp. 54–263. ACM Press, New York (1993)
Mora, T.: Gröbner Bases for Non-Commutative Polynomial Rings. In: Calmet, J. (ed.) AAECC 1985. LNCS, vol. 229, pp. 353–362. Springer, Heidelberg (1986)
Mora, T.: An Introduction to Commutative and Noncommutative Gröbner Bases. Theoretical Computer Science 134, 131–173 (1994)
Reinert, B.: On Gröbner Bases in Monoid and Group Rings. PhD thesis, Universität Kaiserslautern (1995)
Reinert, B., Zeckzer, D.: MRC - A System for Computing Gröbner Bases in Monoid and Group Rings. Presented at the 6th Rhine Workshop on Computer Algebra. Sankt Augustin (1998)
Reinert, B., Zeckzer, D.: MRC - Data Structures and Algorithms for Computing in Monoid and Group Rings. Applicable Algebra and Engineering, Communications and Computing 10(1), 41–78 (1999)
Sattler-Klein, A.: An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. Internal Report, Universität Kaiserslautern, to appear in (2007)
Zeckzer, D.: Implementation, Applications, and Complexity of Prefix Gröbner Bases in Monoid and Group Rings. PhD thesis, Universität Kaiserslautern (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Sattler-Klein, A. (2007). An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)