Studies of the nucler equation of state using numerical calculations of nuclear drop collisions

A numerical calculation for the full thermal dynamics of colliding nuclei was developed. Preliminary results are reported for the thermal fluid dynamics in such processes as Coulomb scattering, fusion, fusion-fission, bulk oscillations, compression with heating, and collisions of heated nuclei

On the Potential of Leptonic Minimal Flavour Violation

Minimal Flavour Violation can be realized in several ways in the lepton sector due to the possibility of Majorana neutrino mass terms. We derive the scalar potential for the fields whose background values are the Yukawa couplings, for the simplest See-Saw model with just two right-handed neutrinos, and explore its minima. The Majorana character plays a distinctive role: the minimum of the potential allows for large mixing angles -in contrast to the simplest quark case- and predicts a maximal Majorana phase. This points in turn to a strong correlation between neutrino mass hierarchy and mixing pattern.Comment: 6 pages; version published on Physics Letters

The group of strong Galois objects associated to a cocommutative Hopf quasigroup

Let H be a cocommutative faithfully flat Hopf quasigroup in a strict symmetric monoidal category with equalizers. In this paper we introduce the notion of (strong) Galois H-object and we prove that the set of isomorphism classes of (strong) Galois H-objects is a (group) monoid which coincides, in the Hopf algebra setting, with the Galois group of H-Galois objects introduced by Chase and Sweedler

Complex dynamics of elementary cellular automata emerging from chaotic rules

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order and chaotic systems. A number of attempts have been made to classify CA functions on their space-time dynamics and to predict behaviour of any given function. Examples include mechanical computation, \lambda{} and Z-parameters, mean field theory, differential equations and number conserving features. We aim to classify CA based on their behaviour when they act in a historical mode, i.e. as CA with memory. We demonstrate that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behaviour from almost any initial condition. Thus just in few steps we can select chaotic rules without exhaustive computational experiments or recurring to additional parameters. We provide analysis of well-known chaotic functions in one-dimensional CA, and decompose dynamics of the automata using majority memory exploring glider dynamics and reactions

On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an algorithm that, given an arbitrary finite presentation of an automatic group $\Gamma$, will construct explicit finite models for the skeleta of $K(\Gamma,1)$ and hence compute the integral homology and cohomology of $\Gamma$.Comment: 21 pages, 4 figure