✦ LIBER ✦

A Gröbner basis for Kazhdan-Lusztig ideals

✍ Scribed by Woo, Alexander; Yong, Alexander

Book ID: 118225546
Publisher: John Hopkins University Press
Year: 2012
Tongue: English
Weight: 923 KB
Volume: 134
Category: Article
ISSN: 0002-9327
DOI: 10.1353/ajm.2012.0031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lucky ideals for Gröbner basis comput

On lucky ideals for Gröbner basis computations

✍ Franz Pauer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Kazhdan-Lusztig polynomials and canonica

Kazhdan-Lusztig polynomials and canonical basis

✍ I. B. Frenkel; M. G. Khovanov; A. A. Kirillov 📂 Article 📅 1998 🏛 SP Birkhäuser Verlag Boston 🌐 English ⚖ 710 KB

W-Gröbner basis and monomial ideals unde

W-Gröbner basis and monomial ideals under polynomial composition

✍ Dong-mei Li; Jin-wang Liu; Wei-jun Liu 📂 Article 📅 2011 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 166 KB

Parallel algorithms for Gröbner-basis co

Parallel algorithms for Gröbner-basis construction

✍ V. A. Mityunin; E. V. Pankratiev 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 257 KB

Gröbner basis for norm-trace codes

✍ J.I. Farrán; C. Munuera; G. Tizziotti; F. Torres 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 224 KB

An Optimal Algorithm for Constructing th

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals

✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu