Abstract

If a homogeneous bracket polynomial is antisymmetric in certain subsets of its points, then it can be represented in an abbreviated form called a dotted bracket expression. These dotted bracket expressions lead to a more compact expression in terms of tableaux than the usual representation. Consequently, we can derive a much more efficient straightening algorithm than the ordinary one for bracket polynomials already given in dotted form. This dotted straightening algorithm gives precisely the same result as the ordinary one, and preserves the dotted property at every step.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.