Triangulations and moduli spaces of Riemann surfaces with group actions

Summary We study that subset of the moduli space of stable genusg,g>1, Riemann surfaces which consists of such stable Riemann surfaces on which a given finite groupF acts. We show first that this subset is compact. It turns out that, for general finite groupsF, the above subset is not connected. We show, however, that for ℤ₂ actions this subsetis connected. Finally, we show that even in the moduli space ofsmooth genusg Riemann surfaces, the subset of those Riemann surfaces on which ℤ₂ actsis connected. In view of deliberations of Klein ([8]), this was somewhat surprising. These results are based on new coordinates for moduli spaces. These coordinates are obtained by certainregular triangulations of Riemann surfaces. These triangulations play an important role also elsewhere, for instance in approximating eigenfunctions of the Laplace operator numerically. This work has been supported by the European Communities Science Plan Project No SCI^*-CT91 (TSTS) “Computational Methods in the Theory of Riemann Surfaces and Algebraic Curves,” by Academy of Finland and by the Swiss National Science Foundation Grant 20-34099.92. We thank M. C. Petrus for providing excellent motivation for this work. This article was processed by the author using the LATEX style filecljourl from Springer-Verlag.     

The job-shop problem and immediate selection

The job-shop problem is one of the most difficult NP-hard scheduling problems. A 10×10-problem published in 1963 has been solved only recently by Carlier and Pinson using a branch and bound method. Other branch and bound algorithms have been developed recently. The efficiency of all these branch and bound methods relies on the concept of immediate selection which allows to introduce order relations on the setI of all operations to be processed on the same machine before branching. We present new algorithms for immediate selection. Among them are

1. anO(max {n logn,f})-algorithm for fixing all disjunctions induced by cliques;
2. anO(n ²)-algorithm based on concepts which are different from those used by Carlier and Pinson.

Here,n is the number of operations inI andf is the number of induced order relations.     

Bell-type inequalities in horizontal sums of Boolean algebras

We give a necessary and sufficient condition for a Bell-type inequality to hold in a horizontal sum of finitely many finite Boolean algebras.