Gröbner-Shirshov bases: Some new results
LA Bokut, Y Chen - Advances in Algebra and Combinatorics, 2008 - World Scientific
Advances in Algebra and Combinatorics : GRÖBNER-SHIRSHOV BASES: SOME NEW
RESULTS Page 1 Advances in Algebra and Combinatorics edited by K. P. Shum et al. 0 World …
RESULTS Page 1 Advances in Algebra and Combinatorics edited by K. P. Shum et al. 0 World …
String rewriting and Gröbner bases—a general approach to monoid and group rings
K Madlener, B Reinert - Symbolic rewriting techniques, 1997 - Springer
The concept of algebraic simplification is of great importance for the field of symbolic
computation in computer algebra. In this paper we review some fundamental concepts …
computation in computer algebra. In this paper we review some fundamental concepts …
Boolean Term Orders and the Root System Bn
D Maclagan - Order, 1998 - Springer
A Boolean term order is a total order on subsets of [n]={1,..., n} such that∅≺ α for all α [n],
α≠∅, and α≺ β⇒ α∪ γ≺ β∪ γ for all γ with γ∩(α∪ β)=∅. Boolean term orders arise in …
α≠∅, and α≺ β⇒ α∪ γ≺ β∪ γ for all γ with γ∩(α∪ β)=∅. Boolean term orders arise in …
On Groebner Basis in Monoid and Group Rings
B Reinert - arXiv preprint arXiv:0903.5044, 2009 - arxiv.org
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently
applied to solve algorithmic problems, such as the congruence problem for ideals. Until now …
applied to solve algorithmic problems, such as the congruence problem for ideals. Until now …
Koszulity, supersolvability, and Stirling representations
A Almousa, V Reiner, S Sundaram - arXiv preprint arXiv:2404.10858, 2024 - arxiv.org
Supersolvable hyperplane arrangements and matroids are known to give rise to certain
Koszul algebras, namely their Orlik-Solomon algebras and graded Varchenko-Gel'fand …
Koszul algebras, namely their Orlik-Solomon algebras and graded Varchenko-Gel'fand …
Composition–Diamond lemma for tensor product of free algebras
LA Bokut, Y Chen, Y Chen - Journal of Algebra, 2010 - Elsevier
In this paper, we establish a Composition–Diamond lemma for the tensor product k〈 X〉⊗
k〈 Y〉 of two free algebras over a field. As an application, we construct a Gröbner–Shirshov …
k〈 Y〉 of two free algebras over a field. As an application, we construct a Gröbner–Shirshov …
Algorithms and orders for finding noncommutative Grobner bases
BJ Keller - 1997 - search.proquest.com
The problem of choosing efficient algorithms and good admissible orders for computing
Grobner bases in noncommutative algebras is considered. Grobner bases are an important …
Grobner bases in noncommutative algebras is considered. Grobner bases are an important …
Composition-Diamond lemma for differential algebras
Y Chen, Y Chen, Y Li - arXiv preprint arXiv:0805.2327, 2008 - arxiv.org
arXiv:0805.2327v2 [math.RA] 23 May 2009 Composition-Diamond Lemma for Differential
Algebras Page 1 arXiv:0805.2327v2 [math.RA] 23 May 2009 Composition-Diamond Lemma …
Algebras Page 1 arXiv:0805.2327v2 [math.RA] 23 May 2009 Composition-Diamond Lemma …
Gröbner bases in Clifford and Grassmann algebras
D Hartley, P Tuckey - Journal of Symbolic Computation, 1995 - Elsevier
We give an account of the theory of Gröbner bases for Clifford and Grassmann algebras,
both important in physical applications. We describe a characterization criterion tailored to …
both important in physical applications. We describe a characterization criterion tailored to …
Alternatives in implementing noncommutative Gröbner basis systems
BJ Keller - Symbolic Rewriting Techniques, 1996 - Springer
Alternatives in implementing systems for computing Grabner bases of two-sided ideals in
noncommutative algebras (presented as path algebras) are considered and compared …
noncommutative algebras (presented as path algebras) are considered and compared …