CP Violation and the CKM Matrix: Assessing the Impact of the Asymmetric B Factories

We update the profile of the CKM matrix. The apex (rhobar,etabar) of the Unitarity Triangle is given by means of a global fit. We propose to include therein sin2alpha from the CP-violating asymmetries in B0->rho+rho-, using isospin to discriminate the penguin contribution. The constraint from epsilon'/epsilon is briefly discussed. We study the impact from the measurement of the rare decay K+->pi+nunu-bar, and from a future observation of KL->pi0nunubar. The B system is investigated in detail, beginning with 2beta+gamma and gamma from B0->D(*)+-pi-+ and B+->D(*)0K+. A significant part of this paper is dedicated to B decays into pipi, Kpi, rhopi and rhorho. Various phenomenological and theoretical approaches are studied. Within QCD Factorization we find a remarkable agreement of the pipi and Kpi data with the other UT constraints. A fit of QCD FA to all pipi and Kpi data leads to precise predictions of the related observables. We analyze separately the B->Kpi decays, and in particular the impact of electroweak penguins in response to recent phenomenological discussions. We find no significant constraint on electroweak nor hadronic parameters. We do not observe any unambiguous sign of New Physics, whereas there is some evidence for potentially large rescattering effects. Finally we use a model-independent description of a large class of New Physics effects in both BBbar mixing and B decays, namely in the b->d and b->s gluonic penguin amplitudes, to perform a new numerical analysis. Significant non-standard corrections cannot be excluded yet, however standard solutions are favored in most cases.Comment: Final version accepted for publication in EPJ C, updated results and plots are available at: http://ckmfitter.in2p3.fr or http://www.slac.stanford.edu/xorg/ckmfitter/ (mirror

A generic, collaborative framework for internal constraint solving

Esta tesis propone un esquema genérico y cooperativo para CLP(Interval(X)) donde X es cualquier dominio de computación con estructura de retículo. El esquema, que está basado en la teoría de retículos, es un enfoque general para la satisfacción y op-timización de restricciones de intervalo así como para la cooperación de resolutores de intervalo definidos sobre dominios de computación con estructura de retículos, independientemente de la cardinalidad de estos. Nuestra propuesta asegura un enfoque transparente sobre el cual las restricciones, los dominios de computación y los mecanismos de propagación y cooperación, definidos entre las variables restringidas, pueden ser fácilmente especificados a nivel del usuario. La parte principal de la tesis presenta una especificación formal de este esquema.Los principales resultados conseguidos en esta tesis son los siguientes:Una comparativa global de la eficiencia y algunos aspectos de la expresividad de ocho sistemas de restricciones. Esta comparativa, realizada sobre el dominio finito y el dominio Booleano, muestra diferencias principales entre los sistemas de restricciones existentes.Para formalizar el marco de satisfacción de restricciones para CLP(Interval(X))hemos descrito el proceso global de resolución de restricciones de intervalo sobre cualquier retículo, separando claramente los procesos de propagación y división (ramificación) de intervalos. Una de las ventajas de nuestra propuesta es que la monótona de las restricciones esta implícitamente definida en la teoría. Además, declaramos un conjunto de propiedades interesantes que, bajo ciertas condiciones, son satisfechas por cualquier instancia del esquema genérico. Mas aún, mostramos que muchos sistemas de restricciones actualmente existentes satisfacen estas condiciones y, además, proporcionamos indicaciones sobre como extender el sistema mediante la especificación de otras instancias interesantes y novedosas. Nuestro esquema para CLP(Interval(X)) permite la cooperación de resolutores de manera que la información puede ⁰uir entre diferentes dominios de computación.Además, es posible combinar distintas instancias del esquema: por ejemplo, instancias bien conocidas tales como CLP(Interval(<)), CLP(Interval(Integer)),CLP(Interval(Set)), CLP(Interval(Bool)), y otras novedosas que son el resultado de la generación de nuevos dominios de computación definidos por el usuario, o incluso que surgen de la combinación de dominios ya existentes como puede ser CLP(Interval(X1 £ : : : £ Xn)). Por lo tanto, X puede ser instanciado a cualquier conjunto de dominios de computación con estructura de retículo de forma que su correspondiente instancia CLP(Interval(X)) permite una amplia flexibilidad en la definición de dominios en X (probablemente definidos por el usuario) y en la interaccion entre estos dominios.Mediante la implementacion de un prototipo, demostramos que un unico sistema,que este basado en nuestro esquema para CLP(Interval(X)), puede proporcionarsoporte para la satisfaccion y la optimizacion de restricciones as como para la cooperacion de resolutores sobre un conjunto conteniendo multiples dominios decomputacion. Ademas, el sistema sigue un novedoso enfoque transparente sujeto a una doble perspectiva ya que el usuario puede definir no solo nuevas restricciones y su mecanismo de propagacion, sino tambien nuevos dominios sobre los cuales nuevas restricciones pueden ser resueltas as como el mecanismo de cooperacion entre todos los dominios de computación (ya sean definidos por el usuario o predefinidos por el sistema).En nuestra opinión, esta tesis apunta nuevas y potenciales direcciones de investigación dentro de la comunidad de las restricciones de intervalo.Para alcanzar los resultados expuestos, hemos seguido los siguientes pasos (1) la elección de un enfoque adecuado sobre el cual construir los fundamentos teóricos de nuestro esquema genérico; (2) la construcción de un marco teórico genérico (que llamaremos el marco básico) para la propagación de restricciones de intervalo sobre cualquier retículo; (3) la integración, en el marco básico, de una técnica novedosa que facilita la cooperación de resolutores y que surge de la definición, sobre múltiples dominios, de operadores de restricciones y (4) la extensión del marco resultante para la resolución y optimización completa de las restricciones de intervalo.Finalmente presentamos clp(L), un lenguaje de programación lógica de restricciones de intervalo que posibilita la resolución de restricciones sobre cualquier conjunto de retículos y que esta implementado a partir de las ideas formalizadas en el marco teórico. Describimos una primera implementación de este lenguaje y desarrollamos algunos ejemplos de como usarla. Este prototipo demuestra que nuestro esquema para CLP(Interval(X)) puede ser implementado en un sistema único que, como consecuencia, proporciona, bajo un enfoque transparente sobre dominios y restricciones, cooperación de resolutores así como satisfacción y optimización completa de restricciones sobre diferentes dominios de computación

Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs

We consider the problem of computing numerical invariants of programs, for instance bounds on the values of numerical program variables. More specifically, we study the problem of performing static analysis by abstract interpretation using template linear constraint domains. Such invariants can be obtained by Kleene iterations that are, in order to guarantee termination, accelerated by widening operators. In many cases, however, applying this form of extrapolation leads to invariants that are weaker than the strongest inductive invariant that can be expressed within the abstract domain in use. Another well-known source of imprecision of traditional abstract interpretation techniques stems from their use of join operators at merge nodes in the control flow graph. The mentioned weaknesses may prevent these methods from proving safety properties. The technique we develop in this article addresses both of these issues: contrary to Kleene iterations accelerated by widening operators, it is guaranteed to yield the strongest inductive invariant that can be expressed within the template linear constraint domain in use. It also eschews join operators by distinguishing all paths of loop-free code segments. Formally speaking, our technique computes the least fixpoint within a given template linear constraint domain of a transition relation that is succinctly expressed as an existentially quantified linear real arithmetic formula. In contrast to previously published techniques that rely on quantifier elimination, our algorithm is proved to have optimal complexity: we prove that the decision problem associated with our fixpoint problem is in the second level of the polynomial-time hierarchy.Comment: 35 pages, conference version published at ESOP 2011, this version is a CoRR version of our submission to Logical Methods in Computer Scienc

The critical catastrophe revisited

The neutron population in a prototype model of nuclear reactor can be described in terms of a collection of particles confined in a box and undergoing three key random mechanisms: diffusion, reproduction due to fissions, and death due to absorption events. When the reactor is operated at the critical point, and fissions are exactly compensated by absorptions, the whole neutron population might in principle go to extinction because of the wild fluctuations induced by births and deaths. This phenomenon, which has been named critical catastrophe, is nonetheless never observed in practice: feedback mechanisms acting on the total population, such as human intervention, have a stabilizing effect. In this work, we revisit the critical catastrophe by investigating the spatial behaviour of the fluctuations in a confined geometry. When the system is free to evolve, the neutrons may display a wild patchiness (clustering). On the contrary, imposing a population control on the total population acts also against the local fluctuations, and may thus inhibit the spatial clustering. The effectiveness of population control in quenching spatial fluctuations will be shown to depend on the competition between the mixing time of the neutrons (i.e., the average time taken for a particle to explore the finite viable space) and the extinction time.Comment: 16 pages, 6 figure

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

Fixed-Node Monte Carlo Calculations for the 1d Kondo Lattice Model

The effectiveness of the recently developed Fixed-Node Quantum Monte Carlo method for lattice fermions, developed by van Leeuwen and co-workers, is tested by applying it to the 1D Kondo lattice, an example of a one-dimensional model with a sign problem. The principles of this method and its implementation for the Kondo Lattice Model are discussed in detail. We compare the fixed-node upper bound for the ground state energy at half filling with exact-diagonalization results from the literature, and determine several spin correlation functions. Our `best estimates' for the ground state correlation functions do not depend sensitively on the input trial wave function of the fixed-node projection, and are reasonably close to the exact values. We also calculate the spin gap of the model with the Fixed-Node Monte Carlo method. For this it is necessary to use a many-Slater-determinant trial state. The lowest-energy spin excitation is a running spin soliton with wave number pi, in agreement with earlier calculations.Comment: 19 pages, revtex, contribution to Festschrift for Hans van Leeuwe

Non-Euclidean geometry in nature

I describe the manifestation of the non-Euclidean geometry in the behavior of collective observables of some complex physical systems. Specifically, I consider the formation of equilibrium shapes of plants and statistics of sparse random graphs. For these systems I discuss the following interlinked questions: (i) the optimal embedding of plants leaves in the three-dimensional space, (ii) the spectral statistics of sparse random matrix ensembles.Comment: 52 pages, 21 figures, last section is rewritten, a reference to chaotic Hamiltonian systems is adde

Aging in One-Dimensional Coagulation-Diffusion Processes and the Fredrickson-Andersen Model

We analyse the aging dynamics of the one-dimensional Fredrickson-Andersen (FA) model in the nonequilibrium regime following a low temperature quench. Relaxation then effectively proceeds via diffusion limited pair coagulation (DLPC) of mobility excitations. By employing a familiar stochastic similarity transformation, we map exact results from the free fermion case of diffusion limited pair annihilation to DLPC. Crucially, we are able to adapt the mapping technique to averages involving multiple time quantities. This relies on knowledge of the explicit form of the evolution operators involved. Exact results are obtained for two-time correlation and response functions in the free fermion DLPC process. The corresponding long-time scaling forms apply to a wider class of DLPC processes, including the FA model. We are thus able to exactly characterise the violations of the fluctuation-dissipation theorem (FDT) in the aging regime of the FA model. We find nontrivial scaling forms for the fluctuation-dissipation ratio (FDR) X = X(tw/t), but with a negative asymptotic value X = -3*pi/(6*pi - 16) = -3.307. While this prevents a thermodynamic interpretation in terms of an effective temperature, it is a direct consequence of probing FDT with observables that couple to activated dynamics. The existence of negative FDRs should therefore be a widespread feature in non mean-field systems.Comment: 39 pages, 4 figure