ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Commutativity theorems: examples in search of algorithms
Full text PdfPdf (692 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1999 international symposium on Symbolic and algebraic computation table of contents
Vancouver, British Columbia, Canada
Pages: 31 - 36  
Year of Publication: 1999
ISBN:1-58113-073-2
Author
John J. Wavrik  Department of Mathematics, University of California, San Diego, La Jolla, CA
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/309831.309851
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
 
2
BUCttBI~;RGEP~, B. GrSbner ba.ses: an algorithmic method in polynonlial ideal theory. In Recent Trends in Multidimensional System Theory. Rcidel, 1985.
 
3
HELTON... J. W., STANKUS, M., ANI.) ~VAVRIK, J. J. Computer simplification of formula.s in linear systems theory. 1EEE 25"ansaction.~ on Automatic Control 43 (1998). 302 314.
 
4
HER.STEIN, I. N. Noncommutative Rings. No. 15 in Carus Mathematical Monographs. American Mathematical Society, 1968.
 
5
HERSTEIN. I. N. 7bpics in Algebra., 2nd Ed. Xerox, 1975.
 
6
Ferdinando Mora, Groebner Bases for Non-Commutative Polynomial Rings, Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes, p.353-362, July 15-19, 1985
 
7
F. Leon Pritchard, The ideal membership problem in non-commutative polynomial rings, Journal of Symbolic Computation, v.22 n.1, p.27-48, July 1996  [doi>10.1006/jsco.1996.0040]
 
8
WAVR,K, J. J. Rewrite r,lles and simplification of matrix expressions. Computer Science Journal of Moldova (1996), 360 398.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Set theory

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Mechanical theorem proving


General Terms:
Algorithms, Performance, Theory, Verification


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player