Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view

Bound on the curvature of the Isgur-Wise function of the baryon semileptonic decay Lambda_b -> Lambda_c + l + nu

In the heavy quark limit of QCD, using the Operator Product Expansion, the formalism of Falk for hadrons or arbitrary spin, and the non-forward amplitude, as proposed by Uraltsev, we formulate sum rules involving the Isgur-Wise function $\xi_{\Lambda} (w)$ of the baryon transition $\Lambda_b \to \Lambda_c \ell \overline{\nu}_{\ell}$, where the light cloud has $j^P=0^+$ for both initial and final baryons. We recover the lower bound for the slope $\rho_\Lambda^2 = - \xi '_\Lambda (1) \geq 0$ obtained by Isgur et al., and we generalize it by demonstrating that the IW function $\xi_{\Lambda} (w)$ is an alternate series in powers of $(w-1)$, i.e. $(-1)^n \xi_{\Lambda}^{(n)} (1) \geq 0$. Moreover, exploiting systematically the sum rules, we get an improved lower bound for the curvature in terms of the slope, $\sigma_\Lambda^2 = \xi "_\Lambda (1) \geq {3 \over 5} [\rho_\Lambda^2 + (\rho_\Lambda^2)^2]$. This bound constrains the shape of the Isgur-Wise function and it will be compelling in the analysis of future precise data on the differential rate of the baryon semileptonic decay $\Lambda_b \to \Lambda_c \ell \overline{\nu}_{\ell}$, that has a large measured branching ratio, of about 5%.Comment: 16 page

Sum rules for leading and subleading form factors in Heavy Quark Effective Theory using the non-forward amplitude

Within the OPE, we the new sum rules in Heavy Quark Effective Theory in the heavy quark limit and at order 1/m_Q, using the non-forward amplitude. In particular, we obtain new sum rules involving the elastic subleading form factors chi_i(w) (i = 1,2, 3) at order 1/m_Q that originate from the L_kin and L_mag perturbations of the Lagrangian. To the sum rules contribute only the same intermediate states (j^P, J^P) = ((1/2)^-, 1^-), ((3/2)^-, 1^-) that enter in the 1/m_Q^2 corrections of the axial form factor h_(A_1)(w) at zero recoil. This allows to obtain a lower bound on -delta_(1/m^2)^(A_1) in terms of the chi_i(w) and the shape of the elastic IW function xi(w). An important theoretical implication is that chi'_1(1), chi_2(1) and chi'_3(1) (chi_1(1) = chi_3(1) = 0 from Luke theorem) must vanish when the slope and the curvature attain their lowest values rho^2->3/4, sigma^2->15/16. These constraints should be taken into account in the exclusive determination of |V_(cb)|.Comment: Invited talk to the International Workshop on Quantum Chromodynamics : Theory and Experiment, Conversano (Bari, Italy), 16-20 June 200