ACM Home Page
Please provide us with feedback. Feedback
An algorithm for finding symmetric Grobner bases in infinite dimensional rings
Full text PdfPdf (232 KB)
Source
International Conference on Symbolic and Algebraic Computation archive
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation table of contents
Linz/Hagenberg, Austria
SESSION: Contributed papers table of contents
Pages 117-124  
Year of Publication: 2008
ISBN:978-1-59593-904-3
Authors
Matthias Aschenbrenner  University of California, Los Angeles, Los Angeles, CA, USA
Christopher J. Hillar  Texas A&M University, College Station, TX, USA
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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/1390768.1390787
What is a DOI?

ABSTRACT

A symmetric ideal I ⊂ R = K[x1,x2,...] is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Grobner bases for symmetric ideals in the infinite dimensional polynomial ring R. This allows for symbolic computation in a new class of rings. In particular, we solve the ideal membership problem for symmetric ideals of R.


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
M. Aschenbrenner and C. J. Hillar. Finite generation of symmetric ideals. Trans. Amer. Math. Soc., 359(11):5171--5192, 2007.
 
2
B. Buchberger. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Math., 4:374--383, 1970.
 
3
 
4
D. A. Cox, J. Little, and D. O'Shea. Using algebraic geometry, volume 185 of Graduate Texts in Mathematics. Springer, New York, second edition, 2005.
 
5
M. Drton, B. Sturmfels, and S. Sullivant. Algebraic factor analysis: tetrads, pentads and beyond. Probab. Theory Related Fields, 138(3-4):463--493, 2007.
6
 
7
C. J. Hillar and T. Windfeldt. Minimal generators for symmetric ideals. Proc. Amer. Math. Soc., to appear.
 
8
A. Mead, E. Ruch, and A. Schönhofer. Theory of chirality functions, generalized for molecules with chiral ligands. Theor. Chim. Acta, 29:269--304, 1973.
 
9
E. Ruch and A. Schönhofer. Theorie der chiralit\"atsfunktionen. Theor. Chim. Acta, 19:225--287, 1970.
 
10
E. Ruch, A. Schönhofer, and I. Ugi. Die vandermondesche determinante als n\"aherungsansatz für eine chiralit\"atsbeobachtung, ihre verwendung in der stereochemie und zur berechnung der optischen aktivitat. Theor. Chim. Acta, 7:420--432, 1967.

Collaborative Colleagues:
Matthias Aschenbrenner: colleagues
Christopher J. Hillar: colleagues