An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman integrals, allowing for fast numerical evaluation. The results are valid in all kinematical regions, both above and below thresholds, up to in principle arbitrary orders in the dimensional regulator. The scope of the algorithm is demonstrated by presenting results for selected two-loop threepoint and four-point integrals with an internal mass scale that appear in the two-loop amplitudes for Higgs+jet production.
We investigate bounds on decoherence in quantum mechanics by studying B and D-mixing observables, making use of many precise new measurements, particularly from the LHC and B factories. In that respect we show that the stringent bounds obtained by a different group in 2013 rely on unjustified assumptions. Finally, we point out which experimental measurements could improve the decoherence bounds considerably. Crown
This work was supported by the European Commission under the FP7 project number 242497 Resilient Infrastructure and BuildingSecurity (RIBS) and by the Polish Ministry of Science and Higher Education under research project Nr 0 R00 0111 12.
Abstract-The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other areas in science and industry. One instance of a CSP, the satisfiability problem in propositional logic (SAT), has become increasingly popular and has illuminated important insights into our understanding of the fundamentals of computation.Though the concept of representing propositional formulae as n-partite graphs is certainly not novel, in this paper we introduce a new polynomial reduction from 3SAT to G n 7 graphs and demonstrate that this framework has advantages over the standard representation. More specifically, after presenting the reduction we show that many hard 3SAT instances represented in this framework can be solved using a basic path-consistency algorithm, and finally we discuss the potential advantages and implications of using such a representation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.