Monte-Carlo simulations of QCD Thermodynamics in the PNJL model

We apply a Monte-Carlo method to the two flavor Polyakov loop extended Nambu and Jona-Lasinio (PNJL) model. In such a way we can go beyond mean field calculations introducing fluctuations of the fields. We study the impact of fluctuations on the thermodynamics of the model. We calculate the second derivatives of the thermodynamic grand canonical partition function with respect to the chemical potential and present a comparison with lattice data also for flavor non-diagonal susceptibilities.Comment: Contribution to Cortona 2008, Theoretical nuclear physics in Ital

Thermodynamics of a three-flavor nonlocal Polyakov--Nambu--Jona-Lasinio model

The present work generalizes a nonlocal version of the Polyakov loop-extended Nambu and Jona-Lasinio (PNJL) model to the case of three active quark flavors, with inclusion of the axial U(1) anomaly. Gluon dynamics is incorporated through a gluonic background field, expressed in terms of the Polyakov loop. The thermodynamics of the nonlocal PNJL model accounts for both chiral and deconfinement transitions. Our results obtained in mean-field approximation are compared to lattice QCD results for $N_\text{f}=2+1$ quark flavors. Additional pionic and kaonic contributions to the pressure are calculated in random phase approximation. Finally, this nonlocal 3-flavor PNJL model is applied to the finite density region of the QCD phase diagram. It is confirmed that the existence and location of a critical point in this phase diagram depends sensitively on the strength of the axial U(1) breaking interaction.Comment: 31 pages, 15 figures, minor changes compared to v

Thermodynamics and quark susceptibilities: a Monte-Carlo approach to the PNJL model

The Monte-Carlo method is applied to the Polyakov-loop extended Nambu--Jona-Lasinio (PNJL) model. This leads beyond the saddle-point approximation in a mean-field calculation and introduces fluctuations around the mean fields. We study the impact of fluctuations on the thermodynamics of the model, both in the case of pure gauge theory and including two quark flavors. In the two-flavor case, we calculate the second-order Taylor expansion coefficients of the thermodynamic grand canonical partition function with respect to the quark chemical potential and present a comparison with extrapolations from lattice QCD. We show that the introduction of fluctuations produces only small changes in the behavior of the order parameters for chiral symmetry restoration and the deconfinement transition. On the other hand, we find that fluctuations are necessary in order to reproduce lattice data for the flavor non-diagonal quark susceptibilities. Of particular importance are pion fields, the contribution of which is strictly zero in the saddle point approximation

Extensions and further applications of the nonlocal Polyakov--Nambu--Jona-Lasinio model

The nonlocal Polyakov-loop-extended Nambu--Jona-Lasinio (PNJL) model is further improved by including momentum-dependent wave-function renormalization in the quark quasiparticle propagator. Both two- and three-flavor versions of this improved PNJL model are discussed, the latter with inclusion of the (nonlocal) 't Hooft-Kobayashi-Maskawa determinant interaction in order to account for the axial U(1) anomaly. Thermodynamics and phases are investigated and compared with recent lattice-QCD results.Comment: 28 pages, 11 figures, 4 tables; minor changes compared to v1; extended conclusion

Super-resolution provided by the arbitrarily strong superlinearity of the blackbody radiation

Blackbody radiation is a fundamental phenomenon in nature, and its explanation by Planck marks a cornerstone in the history of Physics. In this theoretical work, we show that the spectral radiance given by Planck's law is strongly superlinear with temperature, with an arbitrarily large local exponent for decreasing wavelengths. From that scaling analysis, we propose a new concept of super-resolved detection and imaging: if a focused beam of energy is scanned over an object that absorbs and linearly converts that energy into heat, a highly nonlinear thermal radiation response is generated, and its point spread function can be made arbitrarily smaller than the excitation beam focus. Based on a few practical scenarios, we propose to extend the notion of super-resolution beyond its current niche in microscopy to various kinds of excitation beams, a wide range of spatial scales, and a broader diversity of target objects

Constraint Satisfaction with Counting Quantifiers

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly between exists^1:=exists and exists^n:=forall (the domain being of size n) already affords the maximal possible complexity of QCSPs (which have both exists and forall), being Pspace-complete for a suitably chosen template. Next, we focus on the complexity of subsets of counting quantifiers on clique and cycle templates. For cycles we give a full trichotomy -- all such problems are in L, NP-complete or Pspace-complete. For cliques we come close to a similar trichotomy, but one case remains outstanding. Afterwards, we consider the generalisation of CSPs in which we augment the extant quantifier exists^1:=exists with the quantifier exists^j (j not 1). Such a CSP is already NP-hard on non-bipartite graph templates. We explore the situation of this generalised CSP on bipartite templates, giving various conditions for both tractability and hardness -- culminating in a classification theorem for general graphs. Finally, we use counting quantifiers to solve the complexity of a concrete QCSP whose complexity was previously open

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Algebraic Properties of Valued Constraint Satisfaction Problem

The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP 2005]. We introduce the notions of weighted algebras and varieties and use the Galois connection due to Cohen et al. [SICOMP 2013] to link VCSP languages to weighted algebras. We show that the difficulty of VCSP depends only on the weighted variety generated by the associated weighted algebra. Paralleling the results for CSPs we exhibit a reduction to cores and rigid cores which allows us to focus on idempotent weighted varieties. Further, we propose an analogue of the Algebraic CSP Dichotomy Conjecture; prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and Zivny 2013] and conservative VCSPs [Kolmogorov and Zivny 2013].Comment: arXiv admin note: text overlap with arXiv:1207.6692 by other author