New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

Authors

  • Abdolali Basiri School of Mathematics and Computer Science, Damghan University, Department of Mathematics, Damghan University,P.O. Box 36715-364, Damghan, Iran.
  • Behzad Salehian School of Mathematics and Computer Science, Damghan University, Department of Mathematics, Damghan University,P.O. Box 36715-364, Damghan, Iran.
  • Sajjad Rahmany School of Mathematics and Computer Science, Damghan University, Department of Mathematics, Damghan University,P.O. Box 36715-364, Damghan, Iran.
Abstract:

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.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An algorithm for computing invariants of differential Galois groups’

This paper presents an algorithm to compute invariants of the differential Galois group of linear differential equations L(y) = 0: if V(L) is the vector space of solutions of L(y) = 0, we show how given some integer m, one can compute the elements of the symmetric power Sym”‘( V(L)) that are left fixed by the Galois group. The bottleneck of previous methods is the construction of a differential...

full text

Rings of Invariants of Finite Groups

We shall prove the fundamental results of Hilbert and Noether for invariant subrings of finite subgroups of the general linear groups in the non-modular case, i.e. when the field has characteristic zero or coprime with the order of the group. We will also derive the Molien’s formula for the Hilbert series of the ring of invariants. We will show, through examples, that the Molien’s formula helps...

full text

New Invariants for Groups

5 Groups 21 5.1 Chains arising from abelianising functions . . . . . . . . . . . . . 21 5.2 Low-dimensional chains . . . . . . . . . . . . . . . . . . . . . . . 25 5.3 (Relatively) aspherical groups . . . . . . . . . . . . . . . . . . . . 30 5.4 The R. Thompson group . . . . . . . . . . . . . . . . . . . . . . . 32 5.5 E-trivial groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ...

full text

a new algorithm and software of individual life insurance and annuity computation

چکیده ندارد.

15 صفحه اول

Computing Modular Invariants of p-groups

Let V be a finite dimensional representation of a p-group, G, over a field, k, of characteristic p. We show that there exists a choice of basis and monomial order for which the ring of invariants, k[V ]G, has a finite SAGBI basis. We describe two algorithms for constructing a generating set for k[V ]G. We use these methods to analyse k[2V3]3 where U3 is the p-Sylow subgroup of GL3(Fp) and 2V3 i...

full text

Computing the Invariants of Finite Abelian Groups

We investigate the computation and applications of rational invariants of the linear action of a finite abelian group in the non-modular case. By diagonalization, the group action is accurately described by an integer matrix of exponents. We make use of linear algebra to compute a minimal generating set of invariants and the substitution to rewrite any invariant in terms of this generating set....

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 49  issue 2

pages  103- 111

publication date 2017-12-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023