Bracket algebra
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a bracket algebra is an algebraic system that connects the notion of a supersymmetry algebra with a symbolic representation of projective invariants. Given that L is a proper signed alphabet and Super[L] is the supersymmetric algebra, the bracket algebra Bracket[L] of dimension n over the field K is the quotient of the algebra Brace{L} obtained by imposing the congruence relations below, where w, w, ..., w" are any monomials in Super[L]: # {w} = 0 if length(w) ≠ n # {w}{w ' }...{w"} = 0 whenever any positive letter a of L occurs more than n times in the monomial {w}{w}...{w"}. # Let {w}{w}...{w"} be a monomial in Brace{L} in which some positive letter a occurs more than n times, and let b, c, d, e, ..., f, g be any letters in L.
In mathematics, a bracket algebra is an algebraic system that connects the notion of a supersymmetry algebra with a symbolic representation of projective invariants. Given that L is a proper signed alphabet and Super[L] is the supersymmetric algebra, the bracket algebra Bracket[L] of dimension n over the field K is the quotient of the algebra Brace{L} obtained by imposing the congruence relations below, where w, w, ..., w" are any monomials in Super[L]: {w} = 0 if length(w) ≠ n {w}{w ' }...{w"} = 0 whenever any positive letter a of L occurs more than n times in the monomial {w}{w}...{w"}. Let {w}{w}...{w"} be a monomial in Brace{L} in which some positive letter a occurs more than n times, and let b, c, d, e, ..., f, g be any letters in L.
See also
Bracket ring
References
. .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1040041629 under CC BY-SA 4.0; modifications have been made.