skip to main content
10.1145/345542.345653acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free access

Solving systems of linear one-sided equations in integer monoid and group rings

Published: 01 July 2000 Publication History

Abstract

One of the applications of Gröbner bases in commutative polynomial rings is to solve linear equations. Here we show how similar results can be obtained for systems of one-sided linear equations in the more general setting of monoid and group rings.

References

[1]
F. Baader. Unij~cation in commutative theories~ Hilbert~s basis theorem and CrSbner bases. In Proc. UNIFY39, 1989.
[2]
T. Becket and V. Weispfenning. CrSbner Bases - A Computational Approach to Commutative Algebra. Springer, 1992.
[3]
K. Madlener and B. Reinert. On CrSbner bases in monoid and group rings. $EKI Report $R-93-08, UniversitSt Kaiserslautern, 1993. http://www-madlener, informat ik. uni-kl, de / agmadlener/st aff/reinert/publications_en, ht ml
[4]
K. Madlener and B. Reinert. CrSbner bases in non-commutative reduction rings. In B. Buchberger and F. Winkler, editors, CrSbner Bases and Applications (Proc. of the Conference 33 Years of CrSbner Bases), volume 251 of London Mathematical Society Lecture Notes Series, pages 408-420. Cambridge University Press, 1998.
[5]
K. Madlener and B. Reinert. String rewriting and CrSbner bases - a general approach to monoid and group rings. In M. Bronstein, J. Grabmeier, and V. Weispfenning, editors, Proceedings of the Workshop on Symbolic Rewriting Techniques~ Monte Verita~ 1995, volume 15 of Progress in Computer Science and Applied Logic, pages 127-180. BirkhSuser, 1998.
[6]
B. Reinert. On CrSbner Bases in Monoid and Croup Rings. PhD thesis, UniversitSt Kaiserslautern, 1995. http://www-madlener, informat ik. uni-kl, de / agmadlener/st aff/reinert/publications_en, ht ml

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '00: Proceedings of the 2000 international symposium on Symbolic and algebraic computation
July 2000
309 pages
ISBN:1581132182
DOI:10.1145/345542
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ISSAC00
Sponsor:

Acceptance Rates

ISSAC '00 Paper Acceptance Rate 40 of 98 submissions, 41%;
Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 193
    Total Downloads
  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)1
Reflects downloads up to 06 Nov 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media