Relativistic approach to positronium levels in a strong magnetic field

We have investigated the bound states of an electron and positron in superstrong magnetic fields typical for neutron stars. The complete relativistic problem of positronium in a strong magnetic field has not been succesfully solved up to now. In particular, we have studied the positronium when it moves relativistically across the magnetic field. A number of problems which deal with the pulsar magnetosphere, as well as the evolution of protoneutron stars, could be considered as a field for application

Correlations in nuclear energy recurrence relations

The excitation energies of states belonging to the ground state bands of heavy even-even nuclei are analysed using recurrence relations. Excellent agreement with experimental data at the 10 keV level is obtained by taking into account strong correlations which emerge in the analysis. This implies that the excitation energies can be written as a polynomial of maximum degree four in the angular momentum.Comment: 4 pages, 1 figure, 1 table, 9 reference

Use of Lagrangian simulations to hindcast the geographical position of propagule release zones in a Mediterranean coastal fish

The study of organism dispersal is fundamental for elucidating patterns of connectivity between populations, thus crucial for the design of effective protection and management strategies. This is especially challenging in the case of coastal fish, for which information on egg release zones (i.e. spawning grounds) is often lacking. Here we assessed the putative location of egg release zones of the saddled sea bream (Oblada melanura) along the south-eastern coast of Spain in 2013. To this aim, we hindcasted propagule (egg and larva) dispersal using Lagrangian simulations, fed with species-specific information on early life history traits (ELTs), with two approaches: 1) back-tracking and 2) comparing settler distribution obtained from simulations to the analogous distribution resulting from otolith chemical analysis. Simulations were also used to assess which factors contributed the most to dispersal distances. Back-tracking simulations indicated that both the northern sector of the Murcia region and some traits of the North-African coast were hydrodynamically suitable to generate and drive the supply of larvae recorded along the coast of Murcia in 2013. With the second approach, based on the correlation between simulation outputs and field results (otolith chemical analysis), we found that the oceanographic characteristics of the study area could have determined the pattern of settler distribution recorded with otolith analysis in 2013 and inferred the geographical position of main O. melanura spawning grounds along the coast. Dispersal distance was found to be significantly affected by the geographical position of propagule release zones. The combination of methods used was the first attempt to assess the geographical position of propagule release zones in the Mediterranean Sea for O. melanura, and can represent a valuable approach for elucidating dispersal and connectivity patterns in other coastal species

Cohomological Finiteness Conditions in Bredon Cohomology

We show that any soluble group $G$ of type Bredon-\FP_{\infty} with respect to the family of all virtually cyclic subgroups such that centralizers of infinite order elements are of type \FP_{\infty} must be virtually cyclic. To prove this, we first reduce the problem to the case of polycyclic groups and then we show that a polycyclic-by-finite group with finitely many conjugacy classes of maximal virtually cyclic subgroups is virtually cyclic. Finally we discuss refinements of this result: we only impose the property Bredon-\FP_n for some $n \leq 3$ and restrict to abelian-by-nilpotent, abelian-by-polycyclic or (nilpotent of class 2)-by-abelian groups.Comment: Corrected a mistake in Lemma 2.4 of the previous version, which had an effect on the results in Section 5 (the condition that all centralisers of infinite order elements are of type $FP_\infty$ was added

An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming

The main advantage of Constraint Programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc). The current best CP approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency; it does this with a filtering algorithm similar to the PrefixSpan method. However, the resulting system is not as scalable as some of the most advanced mining systems like Zaki's cSPADE. We show how, using techniques from both data mining and CP, one can use a generic constraint solver and yet outperform existing specialized systems. This is mainly due to two improvements in the module that computes the projected frequencies: first, computing the projected database can be sped up by pre-computing the positions at which an symbol can become unsupported by a sequence, thereby avoiding to scan the full sequence each time; and second by taking inspiration from the trailing used in CP solvers to devise a backtracking-aware data structure that allows fast incremental storing and restoring of the projected database. Detailed experiments show how this approach outperforms existing CP as well as specialized systems for SPM, and that the gain in efficiency translates directly into increased efficiency for other settings such as mining with regular expressions.Comment: frequent sequence mining, constraint programmin