Combinatorial algorithm for the computation of cyclically standard regular bracket monomials

DOI10.1016/j.jsc.2019.10.023zbMath1464.13004OpenAlexW2984880570WikidataQ126852638 ScholiaQ126852638MaRDI QIDQ2211188

Yuki Nishida, Yoshihide Watanabe, Sennosuke Watanabe

Publication date: 13 November 2020

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2019.10.023

zbMATH Keywords

invariant theorybracket polynomialcircular straightening law

Mathematics Subject Classification ID

Actions of groups on commutative rings; invariant theory (13A50) Combinatorial aspects of commutative algebra (05E40)

Cites Work

• Unnamed Item
• Unnamed Item
• Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov
• The equations for the moduli space of \(n\) points on the line
• Minimum number of fundamental invariants for the binary form of degree 7
• Invariant theory
• About Gordan's algorithm for binary forms
• A complete minimal system of covariants for the binary form of degree 7
• The invariant theory of binary forms
• The tropical Grassmannian
• Covariant algebra of the binary nonic and the binary decimic
• On the Graded Ring of Invariants of Binary Octavics
• Algorithms in invariant theory

This page was built for publication: Combinatorial algorithm for the computation of cyclically standard regular bracket monomials