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 i...

In the study of double-loop computer networks, the diagrams known as L-shapes arise as a graphical representation of an optimal routing for every graph’s node. The description of these diagrams provides an efficient method for computing the diameter and the average minimum distance of the corresponding graphs. We extend these diagrams to multiloop computer networks. For each Cayley digraph with...

Isaacs has defined a character to be super monomial if every primitive character inducing it is linear. Isaacs has conjectured that if G is an M -group with odd order, then every irreducible character is super monomial. We prove that the conjecture is true if G is an M -group of odd order where every irreducible character is a {p}-lift for some prime p. We say that a group where irreducible cha...

Backelin proved that the multigraded Poincaré series for resolving a residue field over a polynomial ring modulo a monomial ideal is a rational function. The numerator is simple, but until the recent work of Berglund there was no combinatorial formula for the denominator. Berglund’s formula gives the denominator in terms of ranks of reduced homology groups of lower intervals in a certain lattic...

We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial automorphisms. Lots of finite groups, including some of the sporadic simple groups can be defined in this mannar. Mathematics Subject Classification: 20Bxx

We present an alternative constructive proof of the Brauer–Witt theorem using the so-called strongly monomial characters that gives rise to an algorithm for computing the Wedderburn decomposition of semisimple group algebras of finite groups.

In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explici...

Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk  have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...

The purpose of this paper is to show the vastness class generalized strongly monomial groups and implication its study on monomiality questions studied by group theorists. so called groups, which a generalization introduced Olivieri, del Río Simón, arose in recent work authors while understanding algebraic structure rational algebras.