Translation planes of large dimension admitting nonsolvable groups

In this article, the question is considered whether there exist finite translation planes with arbitrarily small kernels admitting nonsolvable collineation groups. For any integerN, it is shown that there exist translation planes of dimension >N and orderq ³ admittingGL(2,q) as a collineation group.     

Dependence of slow crack growth in polyethylene on butyl branch density: Morphology and theory

A theoretical equation has been developed to described the rate of slow crack growth in an ethylene-hexene copolymer in terms of the basic morphological parameters. These parameters are spacing of the butyl branches, number of tie molecules, and the thickness of the lamellar crystal. Experimentally, the thickness of the lamellae and the long period were determined as functions of the branch density. The calculation of the number of tie molecules is based on the values of the molecular weight and the long period. The model of slow crack growth is based on the rate of disentanglement of the tie molecules. The rate of disentanglement varies inversely with the number of tie molecules and directly with the number of tie molecules that are not pinned by the branches.     

Mesh selection for stiff two-point boundary value problems

This paper is concerned with the mesh selection algorithm of COLSYS, a well known collocation code for solving systems of boundary value problems. COLSYS was originally designed to solve non-stiff and mildly stiff problems only. In this paper we show that its performance for solving extremely stiff problems can be considerably improved by modifying its error estimation and mesh selection algorithms. Numerical examples indicate the superiority of the modified algorithm.Dedicated to John Butcher on the occasion of his sixtieth birthday     

Group valued measures with the lyapunoff property

Dopo aver dato una definizione di parte convessa di un gruppo topologico, si stabilisce una condizione affinchè il condominio di una misura sia convesso.     

Case study: problem formulation and solution for a real-world sports scheduling problem

This case study paper describes a problem faced every year by the Devon Cricket League in England. Every league match requires two officiating umpires. There are various preferences relating to the deployment of umpires that fall short of being definite constraints. The requirement was to produce a computer system that would allocate umpires in a satisfactory manner without the need for human interaction, since the users of the system will be unqualified amateurs. This necessitated the construction of a very complex objective function, using imprecise and ill-defined information. The biggest challenge was thus one of problem formulation; the solution technique was relatively straightforward. The system has been put into successful use and it is expected that its use will continue indefinitely. The work raises ethical issues regarding work done for customers who are inexperienced amateurs.     

The weak pigeonhole principle for function classes in S 12

It is well known that S ¹₂ cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S ¹₂ for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)