Representation type of Hecke algebras of type

In this paper we provide a complete classification of the representation type for the blocks for the Hecke algebra of type , stated in terms of combinatorical data. The computation of the complexity of Young modules is a key component in the proof of this classification result.     

On the coset laws for skew lattices

Skew lattices are a noncommutative generalization of lattices. In the paper we study the varieties of symmetric, strongly symmetric and cancellative skew lattices, and characterize them in terms of certain laws regarding the coset structure of a skew lattice. As a consequence, combinatorial results connecting powers of D{\mathcal{D}}-classes and indices are derived.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Support Varieties for Selfinjective Algebras

Support varieties for any finite dimensional algebra over a field were introduced in (Proc. London Math. Soc. 88 (3) (2004) 705–732) using graded subalgebras of the Hochschild cohomology ring. We mainly study these varieties for selfinjective algebras under appropriate finite generation hypotheses. Then many of the standard results from the theory of support varieties for finite groups generalize to this situation. In particular, the complexity of the module equals the dimension of its corresponding variety, all closed homogeneous varieties occur as the variety of some module, the variety of an indecomposable module is connected, the variety of periodic modules are lines and for symmetric algebras a generalization of Webbs theorem is true. As a corollary of a more general result we show that Webbs theorem generalizes to finite dimensional cocommutative Hopf algebras.Received November 2003Mathematics Subject Classifications (2000) Primary: 16E40, 16G10, 16P10, 16P20; Secondary: 16G70.     

Extensions of Modules over Schur Algebras, Symmetric Groups and Hecke Algebras

We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.