Completely Simple Semigroups,Lie Algebras,and the Road Coloring Problem

Consider a semigroup generated by matrices associated with an edge-coloring of a strongly connected, aperiodic digraph. We call the semigroup Lie-solvable if the Lie algebra generated by its elements is solvable. We show that if the semigroup is Lie-solvable then its kernel is a right group. Next, we study the Lie algebra generated by the kernel. Lie algebras generated by two idempotents are analyzed in detail. We find that these have homomorphic images that are generalized quaternion algebras. We show that if the kernel is not a direct product, then the Lie algebra generated by the kernel is not solvable by describing the structure of these algebras. Finally, we discuss an infinite class of examples that are shown to always produce strongly connected aperiodic digraphs having kernels that are not right groups.     

On the torsion of Jacobians of principal modular curves of level 3<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We demonstrate that the 3-power torsion points of the Jacobians of the principal modular curves X(3ⁿ) are fixed by the kernel of the canonical outer Galois representation of the pro-3 fundamental group of the projective line minus three points. The proof proceeds by demonstrating the curves in question satisfy a two-part criterion given by Anderson and Ihara. Two proofs of the second part of the criterion are provided; the first relies on a theorem of Shimura, while the second uses the moduli interpretation. Received: 30 September 2005     

A Note on the Kissing Numbers of Superballs

The lower bounds for the translative kissing numbers of superballs are studied in this note. We improve the bound given by Larman and Zong. Furthermore, we give a constructive bound based on algebraic-geometry codes that also improves the bound by Larman and Zong in almost all cases.     

A web-based workforce management system for Sainsburys Supermarkets Ltd

Labour scheduling plays an important and critical role in Sainsburys day to day operations and profitability. The integrated workforce management solution for Sainsburys is an intelligent solution for the operational deployment of human resources, integrated business forecasting, generation and calculation of workload and staff scheduling. The workforce management technology has provided Sainsburys with a fully web-based and centralised system that produces optimised schedules for all employees satisfying the forecasted demand of work with granularity of fifteen minutes. The system is configured to respect all operational and business requirements as well as employee contractual constraints. This paper introduces the workforce management solution system designed, developed and implemented for Sainsburys. We concentrate on two modelling structures, namely the work pattern model and optimisation model, and briefly discuss the optimisation process.     

Homoclinic and Periodic Orbits Arising Near the Heteroclinic Cycle Connecting Saddle-focus and Saddle Under Reversible Condition

In this paper, we study the dynamical behavior for a 4-dimensional reversible system near its heteroclinic loop connecting a saddle-focus and a saddle. The existence of infinitely many reversible 1-homoclinic orbits to the saddle and 2-homoclinic orbits to the saddle-focus is shown. And it is also proved that, corresponding to each 1-homoclinic （resp. 2-homoclinic） orbit F, there is a spiral segment such that the associated orbits starting from the segment are all reversible 1-periodic （resp. 2-periodic） and accumulate onto F. Moreover, each 2-homoclinic orbit may be also accumulated by a sequence of reversible 4-homoclinic orbits.     

Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

An Extension Landau-Lifshitz Model in Studying Soft Ferromagnetic Films

In this paper, we propose a model in studying soft ferromagnetic films, which is readily accessible experimentally. By using penalty approximation and compensated compactness, we prove that the dynamical equation in thin film has a local weak solution. Moreover, the corresponding linear equation is also dealt with in great detail.     

Freedom and trying: Understanding agent-causal exertions

In this paper, I argue that trying is the locus of freedom and moral responsibility. Thus, any plausible view of free and responsible action must accommodate and account for free tryings. I then consider a version of agent causation whereby the agent directly causes her tryings. On this view, the agent is afforded direct control over her efforts and there is no need to posit—as other agent-causal theorists do—an uncaused event. I discuss the potential advantages of this sort of view, and its challenges.     

Another independent self-dual basis for the trivial variety

We give a new independent self-dual 3-basis for the trivial variety with two binary operations. Received October 24, 2006; accepted in final form January 25, 2007.