Detailed nuclear structure studies far from stability

State-of-the-art spectroscopy of nuclei far from stability has achieved an extraordinary level of sophistication and detail in the last ten years. In principle, if a state can be populated, it can be characterized by its energy, spin, parity, and major decay paths. Sometimes its lifetime can be measured. In practice, one is confronted with enormous complexity. To convert raw spectroscopic data into nuclear structure data involves a complex process of disentangling gamma rays and conversion electrons into decay schemes. Specifically, coincidence techniques, especially coincidence intensities, play a crucial role in this process. Recent examples and methods from work done at UNISOR are presented.     

A decomposition theorem for convexity spaces

We utilize the unifying framework of families of convexity spaces for the treatment of various notions of planar convexity and the associated convex hulls. Our major goal is to prove the refinement and decomposition theorems for families of convexity spaces. These general theorems are then applied to two examples: restricted-oriented convex sets andNESW-convex sets. The applications demonstrate the usefulness of these general theorems, since they give rise to simple algorithms for the computation of the associated convex hulls of polygons.     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.     

The critical group from a cryptographic perspective

The critical group of a graph is an abelian group that arisesin several contexts, and there are some similarities with thegroups that are used in cryptography. We construct a familyof graphs with critical groups that are cyclic, and discussthe associated computational problems using algorithms basedon the theory of ‘chip-firing’.