Off-equilibrium photon production during the chiral phase transition

In the early stage of ultrarelativistic heavy-ion collisions chiral symmetry is restored temporarily. During this so-called chiral phase transition, the quark masses change from their constituent to their bare values. This mass shift leads to the spontaneous non-perturbative creation of quark–antiquark pairs, which effectively contributes to the formation of the quark–gluon plasma. We investigate the photon production induced by this creation process. We provide an approach that eliminates possible unphysical contributions from the vacuum polarization and renders the resulting photon spectra integrable in the ultraviolet domain. The off-equilibrium photon numbers are of quadratic order in the perturbative coupling constants while a thermal production is only of quartic order. Quantitatively, we find, however, that for the most physical mass-shift scenarios and for photon momenta larger than 1 GeV the off-equilibrium processes contribute less photons than the thermal processes.     

Cooperative and Non-Cooperative Differential Game Solutions to an Investment and Pricing Problem

A monopoly possesses a finite stock of a resource and wishes to determine an optimal pricing policy. The competitive fringe invests in production capacity and wishes to select an optimal investment rate. Demand towards the monopoly depends on price as well as on the sales rate of the competition. Modelling the situation as a differential game, non-cooperative (Nash and Stackelberg) and cooperative (Pareto) equilibria are determined. Owing to the special structure of the game, these solutions can be found in closed form.     

Testing Extreme Value Conditions

A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution.     

Transverse magnetization transfer under planar mixing conditions in spin systems consisting of three coupled spins 1/2

Polarization transfer under planar mixing conditions is a widely used tool in modern NMR-experiments. In the case of two coupled spins 1/2 or a chain of three or more spins 1/2 with only nearest neighbor couplings, it is only possible to transfer a single magnetization component (longitudinal magnetization in the principle axis system of the planar coupling tensors). However, if all couplings in a three-spin system are non-zero, it turns out that all magnetization components can be efficiently transferred even under strictly planar mixing conditions. In this article a detailed theoretical analysis is presented based on analytical transverse coherence transfer functions and on the underlying commutator algebra. In addition, transverse magnetization transfer is demonstrated experimentally. The results show that in highly coupled spin systems, as for example in the case of partially aligned samples with many residual dipolar couplings, special care has to be taken to avoid phase distortions if planar mixing steps are used.     

Classification of some 3-subgroups of the finite groups of Lie type E6

We consider the finite exceptional group of Lie type $G=E_6^{\epsilon }(q)$ (universal version) with $3|q?\epsilon$, where $E_6^{+1}(q)=E_6(q)$ and $E_6^{?1}(q){=}^2{E}_6(q)$. We classify, up to conjugacy, all maximal-proper 3-local subgroups of G, that is, all 3-local $M<G$ which are maximal with respect to inclusion among all proper subgroups of G which are 3-local. To this end, we also determine, up to conjugacy, all elementary-abelian 3-subgroups containing $Z(G)$, all extraspecial subgroups containing $Z(G)$, and all cyclic groups of order 9 containing $Z(G)$. These classifications are an important first step towards a classification of the 3-radical subgroups of G, which play a crucial role in many open conjectures in modular representation theory.     

Reasoning about proof and knowledge

In previous work [15], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from Gödel's interpretation of IPC in S4, our modal systems contain IPC in the way established in [13]. The modal operator can be viewed as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are partially adopted from Intuitionistic Epistemic Logic IEL [4]. In the present paper, we show that the S5-style systems of our hierarchy correspond to an extended Brouwer–Heyting–Kolmogorov interpretation and are complete w.r.t. a relational semantics based on intuitionistic general frames. In this sense, our S5-style logics are adequate and complete systems for the reasoning about proof combined with belief or knowledge. The proposed relational semantics is a uniform framework in which also IEL can be modeled. Verification-based intuitionistic knowledge formalized in IEL turns out to be a special case of the kind of knowledge described by our S5-style systems.     

Classical simulations of magnetic structures for chromium clusters: Size effects

Classical (Heisenberg) simulations show that the total magnetization of the lowest-energy states of clusters made of antiferromagnetically coupled chromium atoms is planar, rather than collinear, depending on the arrangement of the atoms. Although the model Hamiltonian is not restrictive, many cluster configurations of various numbers of atoms do not use all three directions for the spins. This result confirms the conclusion drawn from the local-spin DFT calculation by Kohl and Bertsch that clusters of N≤13 have non-collinear magnetic moments. The present simulations show non-collinear spin ordering also for bigger clusters, designed to be as spherical as possible following the bcc arrangement, when atoms interact both with the nearest and next-nearest neighbours. Depending on the signs of the coupling constants frustration appears. The advantage of the discrete model, despite the simplicity, is that very large clusters and magnetization at finite temperatures can be studied. This model predicts that clusters with specific numbers of atoms interacting only with the nearest neighbours have collinear spins as in the bulk. We also apply the model to simulate the destruction of the anti-ferromagnetic ordering by thermal fluctuations. This model shows no unique magnetization of mixed Fe _0.33 Cr _0.67, which is consistent with experimental observations.     

Experimental implementation of an adiabatic quantum optimization algorithm

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well-suited three quantum bit molecule and was made possible by introducing a technique that encodes general instances of the given optimization problem into an easily applicable Hamiltonian. Our results indicate an optimal run time of the adiabatic algorithm that agrees well with the prediction of a simple decoherence model.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

1‐Factor and Cycle Covers of Cubic Graphs

Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 .