On Schurity of Finite Abelian Groups

A finite group G is called a Schur group, if any Schur ring over G is associated in a natural way with a subgroup of Sym(G) that contains all right translations. Recently, the authors have completely identified the cyclic Schur groups. In this article, it is shown that any abelian Schur group belongs to one of several explicitly given families only. In particular, any noncyclic abelian Schur group of odd order is isomorphic to ?₃ × ?_{3 ^k} or ?₃ × ?₃ × ? _p where k ≥ 1 and p is a prime. In addition, we prove that ?₂ × ?₂ × ? _p is a Schur group for every prime p.     

The Multiplicity Free Permutation Representations of the Ree Groups 2 G 2(q), the Suzuki Groups 2 B 2(q), and Their Automorphism Groups

Abstract

Let G a simple group of type ² B ₂(q) or ² G ₂(q), where q is an odd power of 2 or 3, respectively. The main goal of this paper is to determine the multiplicity free permutation representations of G and A ≤ Aut(G) where A is a subgroup containing a copy of G. Let B be a Borel subgroup of G. If G = ² B ₂(q) we show that there is only one non-trivial multiplicity free permutation representation, namely the representation of G associated to the action on G/B. If G = ² G ₂(q) we show that there are exactly two such non-trivial representations, namely the representations of G associated to the action on G/B and the action on G/M, where M = UC with U the maximal unipotent subgroup of B and C the unique subgroup of index 2 in the maximal split torus of B. The multiplicity free permutation representations of A correspond to the actions on A/H where H is isomorphic to a subgroup containing B if G = ² B ₂(q), and containing M if G = ² G ₂(q). The problem of determining the multiplicity free representations of the finite simple groups is important, for example, in the classification of distance-transitive graphs.     

Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study

The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-art method for this important and practical scheduling problem.     

Valuation ideals of order one in 2-dimensional regular local rings

Let υ be a prime divisor of a 2-dimensional regular local ring (R m) with algebraically closed residue field k. Zariski showed that a prime divisor υ of R is uniquely associated to a simple m-primary integrally closed ideal I of R, there exist finitely many simple υ-ideals including I, and all the other υ-ideals can be uniquely factored into products of simple υ-ideals. It is known that such an m-primary ideal I of R can be minimally generated by o(I) + 1 elements.Given a simple integrally closed ideal I of order one with arbitrary rank and its associated prime divisor υ, we find minimal generating sets of all the simple υ-ideals and describe factorizations of all the composite υ-ideals in terms of power products of simple υideals as explicitly as possible.