High-performance functional renormalization group calculations for interacting fermions

We derive a novel computational scheme for functional Renormalization Group (fRG) calculations for interacting fermions on 2D lattices. The scheme is based on the exchange parametrization fRG for the two-fermion interaction, with additional insertions of truncated partitions of unity. These insertions decouple the fermionic propagators from the exchange propagators and lead to a separation of the underlying equations. We demonstrate that this separation is numerically advantageous and may pave the way for refined, large-scale computational investigations even in the case of complex multiband systems. Furthermore, on the basis of speedup data gained from our implementation, it is shown that this new variant facilitates efficient calculations on a large number of multi-core CPUs. We apply the scheme to the $t$,$t'$ Hubbard model on a square lattice to analyze the convergence of the results with the bond length of the truncation of the partition of unity. In most parameter areas, a fast convergence can be observed. Finally, we compare to previous results in order to relate our approach to other fRG studies.Comment: 26 pages, 9 figure

Tracking Aqueous Proton Transfer by Two-Dimensional Infrared Spectroscopy and ab Initio Molecular Dynamics Simulations.

Proton transfer in water is ubiquitous and a critical elementary event that, via proton hopping between water molecules, enables protons to diffuse much faster than other ions. The problem of the anomalous nature of proton transport in water was first identified by Grotthuss over 200 years ago. In spite of a vast amount of modern research effort, there are still many unanswered questions about proton transport in water. An experimental determination of the proton hopping time has remained elusive due to its ultrafast nature and the lack of direct experimental observables. Here, we use two-dimensional infrared spectroscopy to extract the chemical exchange rates between hydronium and water in acid solutions using a vibrational probe, methyl thiocyanate. Ab initio molecular dynamics (AIMD) simulations demonstrate that the chemical exchange is dominated by proton hopping. The observed experimental and simulated acid concentration dependence then allow us to extrapolate the measured single step proton hopping time to the dilute limit, which, within error, gives the same value as inferred from measurements of the proton mobility and NMR line width analysis. In addition to obtaining the proton hopping time in the dilute limit from direct measurements and AIMD simulations, the results indicate that proton hopping in dilute acid solutions is induced by the concerted multi-water molecule hydrogen bond rearrangement that occurs in pure water. This proposition on the dynamics that drive proton hopping is confirmed by a combination of experimental results from the literature

BUILDING AN ENTANGLEMENT MEASURE ON PHYSICAL GROUND

We introduce on physical grounds a new measure of multipartite entanglement for pure states. The function we define is discriminant and monotone under LOCC; moreover, it can be expressed in terms of observables of the system.We introduce on physical grounds a new measure of multipartite entanglement for pure states. The function we define is discriminant and monotone under LOCC; moreover, it can be expressed in terms of observables of the system

Exploring Cognitive States: Methods for Detecting Physiological Temporal Fingerprints

Cognitive state detection and its relationship to observable physiologically telemetry has been utilized for many human-machine and human-cybernetic applications. This paper aims at understanding and addressing if there are unique psychophysiological patterns over time, a physiological temporal fingerprint, that is associated with specific cognitive states. This preliminary work involves commercial airline pilots completing experimental benchmark task inductions of three cognitive states: 1) Channelized Attention (CA); 2) High Workload (HW); and 3) Low Workload (LW). We approach this objective by modeling these "fingerprints" through the use of Hidden Markov Models and Entropy analysis to evaluate if the transitions over time are complex or rhythmic/predictable by nature. Our results indicate that cognitive states do have unique complexity of physiological sequences that are statistically different from other cognitive states. More specifically, CA has a significantly higher temporal psychophysiological complexity than HW and LW in EEG and ECG telemetry signals. With regards to respiration telemetry, CA has a lower temporal psychophysiological complexity than HW and LW. Through our preliminary work, addressing this unique underpinning can inform whether these underlying dynamics can be utilized to understand how humans transition between cognitive states and for improved detection of cognitive states

Begin, After, and Later: a Maximal Decidable Interval Temporal Logic

Interval temporal logics (ITLs) are logics for reasoning about temporal statements expressed over intervals, i.e., periods of time. The most famous ITL studied so far is Halpern and Shoham's HS, which is the logic of the thirteen Allen's interval relations. Unfortunately, HS and most of its fragments have an undecidable satisfiability problem. This discouraged the research in this area until recently, when a number non-trivial decidable ITLs have been discovered. This paper is a contribution towards the complete classification of all different fragments of HS. We consider different combinations of the interval relations Begins, After, Later and their inverses Abar, Bbar, and Lbar. We know from previous works that the combination ABBbarAbar is decidable only when finite domains are considered (and undecidable elsewhere), and that ABBbar is decidable over the natural numbers. We extend these results by showing that decidability of ABBar can be further extended to capture the language ABBbarLbar, which lays in between ABBar and ABBbarAbar, and that turns out to be maximal w.r.t decidability over strongly discrete linear orders (e.g. finite orders, the naturals, the integers). We also prove that the proposed decision procedure is optimal with respect to the complexity class

Which space? Whose space? An experience in involving students and teachers in space design

To date, learning spaces in higher education have been designed with little engagement on the part of their most important users: students and teachers. In this paper, we present the results of research carried out in a UK university. The research aimed to understand how students and teachers conceptualise learning spaces when they are given the opportunity to do so in a workshop environment. Over a number of workshops, participants were encouraged to critique a space prototype and to re-design it according to their own views and vision of learning spaces to optimise pedagogical encounters. The findings suggest that the active involvement of students and teachers in space design endows participants with the power of reflection on the pedagogical process, which can be harnessed for the actual creation and innovation of learning spaces

A practical algorithmic approach to mature aggressive B cell lymphoma diagnosis in the double/triple hit era. Selecting cases, matching clinical benefit. A position paper from the Italian Group of Haematopathology (G.I.E.)

An accurate diagnosis of clinically distinct subgroups of aggressive mature B cell lymphomas is crucial for the choice of proper treatment. Presently, precise recognition of these disorders relies on the combination of morphological, immunophenotypical, and cytogenetic/molecular features. The diagnostic workup in such situations implies the application of costly and time-consuming analyses, which are not always required, since an intensified treatment option is reasonably reserved to fit patients. The Italian Group of Haematopathology proposes herein a practical algorithm for the diagnosis of aggressive mature B cell lymphomas based on a stepwise approach, aimed to select cases deserving molecular analysis, in order to optimize time and resources still assuring the optimal management for any patient

Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas

In recent work we have shown how it is possible to define very precise type systems for object-oriented languages by abstractly compiling a program into a Horn formula f. Then type inference amounts to resolving a certain goal w.r.t. the coinductive (that is, the greatest) Herbrand model of f. Type systems defined in this way are idealized, since in the most interesting instantiations both the terms of the coinductive Herbrand universe and goal derivations cannot be finitely represented. However, sound and quite expressive approximations can be implemented by considering only regular terms and derivations. In doing so, it is essential to introduce a proper subtyping relation formalizing the notion of approximation between types. In this paper we study a subtyping relation on coinductive terms built on union and object type constructors. We define an interpretation of types as set of values induced by a quite intuitive relation of membership of values to types, and prove that the definition of subtyping is sound w.r.t. subset inclusion between type interpretations. The proof of soundness has allowed us to simplify the notion of contractive derivation and to discover that the previously given definition of subtyping did not cover all possible representations of the empty type