From superconducting fluctuations to the bosonic limit in the response functions above the critical temperature

We investigate the density, current, and spin response functions above the critical temperature for a system of three-dimensional fermions interacting via an attractive short-range potential. In the strong-coupling (bosonic) limit of this interaction, we identify the dominant diagrammatic contributions for a ``dilute'' system of composite bosons which form as bound-fermion pairs, and compare them with the usual (Aslamazov-Larkin, Maki-Thompson, and density-of-states) terms occurring in the theory of superconducting fluctuations above the critical temperature for a clean system in the weak-coupling limit. We show that, at the zeroth order in the diluteness parameter for the composite bosons, the Aslamazov-Larkin term still represents formally the dominant contribution to the density and current response functions, while the Maki-Thompson and density-of-states terms are strongly suppressed. Corrections to the Aslamazov-Larkin term are then considered at the next order in the diluteness parameter for the composite bosons. The spin response function is also examined, and it is found to be exponentially suppressed in the bosonic limit only when appropriate sets of diagrams are considered simultaneously.Comment: 10 pages, 6 figure

Non-local equation for the superconducting gap parameter

The properties are considered in detail of a non-local (integral) equation for the superconducting gap parameter, which is obtained by a coarse-graining procedure applied to the Bogoliubov-deGennes (BdG) equations over the whole coupling-vs-temperature phase diagram associated with the superfluid phase. It is found that the limiting size of the coarse-graining procedure, which is dictated by the range of the kernel of this integral equation, corresponds to the size of the Cooper pairs over the whole coupling-vs-temperature phase diagram up to the critical temperature, even when Cooper pairs turn into composite bosons on the BEC side of the BCS-BEC crossover. A practical method is further implemented to solve numerically this integral equation in an efficient way, which is based on a novel algorithm for calculating the Fourier transforms. Application of this method to the case of an isolated vortex, throughout the BCS-BEC crossover and for all temperatures in the superfluid phase, helps clarifying the nature of the length scales associated with a single vortex and the kinds of details that are in practice disposed off by the coarse-graining procedure on the BdG equations

Updating DL-Lite ontologies through first-order queries

In this paper we study instance-level update in DL-LiteA, the description logic underlying the OWL 2 QL standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a nonrecursive datalog program. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DLLiteA-based systems and perform some experiments showing that the approach works in practice.Peer ReviewedPostprint (author's final draft

Entanglement between pairing and screening in the Gorkov-Melik-Barkhudarov correction to the critical temperature throughout the BCS-BEC crossover

The theoretical description of the critical temperature Tc of a Fermi superfluid dates back to the work by Gor'kov and Melik-Barkhudarov (GMB), who addressed it for a weakly-coupled (dilute) superfluid in the BCS (weak-coupling) limit of the BCS-BEC crossover. The point made by GMB was that particle-particle (pairing) excitations, which are responsible for superfluidity to occur below Tc, and particle-hole excitations, which give rise to screening also in a normal system, get effectively disentangled from each other in the BCS limit, thus yielding a reduction by a factor 2.2 of the value of Tc obtained when neglecting screening effects. Subsequent work on this topic, aimed at extending the original GMB argument away from the BCS limit with diagrammatic methods, has kept this disentangling between pairing and screening throughout the BCS-BEC crossover, without realising that the conditions for it to be valid are soon violated away from the BCS limit. Here, we reconsider this problem from a more general perspective and argue that pairing and screening are intrinsically entangled with each other along the whole BCS-BEC crossover but for the BCS limit considered by GMB. We perform a detailed numerical calculation of the GMB diagrammatic contribution extended to the whole BCS-BEC crossover, where the full wave-vector and frequency dependence occurring in the repeated in-medium two-particle scattering is duly taken into account. Our numerical calculations are tested against analytic results available in both the BCS and BEC limits, and the contribution of the GMB diagrammatic term to the scattering length of composite bosons in the BEC limit is highlighted. We calculate Tc throughout the BCS-BEC crossover and find that it agrees quite well with Quantum Monte Carlo calculations and experimental data available in the unitarity regime.Comment: 21 pages, 11 figure

Gap equation with pairing correlations beyond mean field and its equivalence to a Hugenholtz-Pines condition for fermion pairs

The equation for the gap parameter represents the main equation of the pairing theory of superconductivity. Although it is formally defined through a single-particle property, physically it reflects the pairing correlations between opposite-spin fermions. Here, we exploit this physical connection and cast the gap equation in an alternative form which explicitly highlights these two-particle correlations, by showing that it is equivalent to a Hugenholtz-Pines condition for fermion pairs. At a formal level, a direct connection is established in this way between the treatment of the condensate fraction in condensate systems of fermions and bosons. At a practical level, the use of this alternative form of the gap equation is expected to make easier the inclusion of pairing fluctuations beyond mean field. As a proof-of-concept of the new method, we apply the modified form of the gap equation to the long-pending problem about the inclusion of the Gorkov-Melik-Barkhudarov correction across the whole BCS-BEC crossover, from the BCS limit of strongly overlapping Cooper pairs to the BEC limit of dilute composite bosons, and for all temperatures in the superfluid phase. Our numerical calculations yield excellent agreement with the recently determined experimental values of the gap parameter for an ultra-cold Fermi gas in the intermediate regime between BCS and BEC, as well as with the available quantum Monte Carlo data in the same regime.Comment: 24 pages, 13 figure

Eliminating Recursion from Monadic Datalog Programs on Trees

We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether a datalog program is equivalent to some nonrecursive one is undecidable but the decidability is regained if the descendant relation is disallowed. Under similar restrictions we obtain decidability of the problem of equivalence to a given nonrecursive program. We investigate the connection between these two problems in more detail

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic EL and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs that are based on the simpler atomic queries, also illuminating the relationship between first-order rewritings of OMQs based on conjunctive and on atomic queries. Experiments with real-world ontologies show promising results