In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-\G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to implement.
Rahmany, S., Basiri, A., & Salehian, B. (2017). New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups. Journal of Algorithms and Computation, 49(2), 103-111. https://doi.org/10.22059/jac.2017.7982
MLA
Rahmany, S., Basiri, A., & Salehian, B. "New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups", Journal of Algorithms and Computation, 49, 2, 2017, 103-111. doi: 10.22059/jac.2017.7982
HARVARD
Rahmany S., Basiri A., Salehian B. (2017). 'New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups', Journal of Algorithms and Computation, 49(2), pp. 103-111. doi: 10.22059/jac.2017.7982
CHICAGO
S. Rahmany, A. Basiri & B. Salehian, "New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups," Journal of Algorithms and Computation, 49 2 (2017): 103-111, doi: 10.22059/jac.2017.7982
VANCOUVER
Rahmany S., Basiri A., Salehian B. New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups. J. Algo. Comp. 2017;49(2):103-111. doi: 10.22059/jac.2017.7982
