2013
DOI: 10.48550/arxiv.1303.0920
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Free associative algebras, noncommutative Grobner bases, and universal associative envelopes for nonassociative structures

Murray R. Bremner

Abstract: The underlying motivation is to apply the theory of noncommutative Gröbner bases in free associative algebras to the construction of universal associative envelopes for nonassociative structures defined by multilinear operations. Trilinear operations were classified by the author and Peresi in 2007. In her Ph.D. thesis of 2012, Elgendy studied the universal associative envelopes of nonassociative triple systems obtained by applying these trilinear operations to the 2-dimensional simple associative triple syste… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 65 publications
(92 reference statements)
0
2
0
Order By: Relevance
“…Given a term order <, for any nonzero element f ∈ ∧{Θ n }, let lm(f ) be the largest monomial θ S under the total order < such that θ S appears with nonzero coefficient in f . If I ⊆ ∧{Θ n } is a two-sided ideal, let The set N (I) of monomials descends to a C-basis of the quotient ∧{Θ n }/I; this is the standard monomial basis with respect to < (see for example [4]).…”
Section: Complex Reflection Groups Letmentioning
confidence: 99%
See 1 more Smart Citation
“…Given a term order <, for any nonzero element f ∈ ∧{Θ n }, let lm(f ) be the largest monomial θ S under the total order < such that θ S appears with nonzero coefficient in f . If I ⊆ ∧{Θ n } is a two-sided ideal, let The set N (I) of monomials descends to a C-basis of the quotient ∧{Θ n }/I; this is the standard monomial basis with respect to < (see for example [4]).…”
Section: Complex Reflection Groups Letmentioning
confidence: 99%
“…Rosas proves [17, Proof of Thm. 13 (4)] that the multiplicity of the Schur function s For any 0 ≤ k ≤ n − 1 and all i + j < n, we have…”
Section: The Permutation Representation Of S Nmentioning
confidence: 99%