Quantitative predictions for B semileptonic decays into D, D*, and the orbitally excited D** in quark models in the manner of Bakamjian and Thomas

Once chosen the dynamics in one frame, the rest frame in this paper, the Bakamjian and Thomas method allows to define relativistic quark models in any frame. These models have been shown to provide, in the infinite quark mass limit, fully covariant current form factors as matrix elements of the quark current operator. In this paper we use the rest frame dynamics fitted from the meson spectrum by various authors, already shown to provide a reasonable value for $\rho^2$. From the general formulae for the scaling invariant form factors $\xi^{(n)}(w)$, $\tau_{1/2}^{(n)}(w)$ and $\tau_{3/2}^{(n)}(w)$, we predict quantitavely the $B$ semileptonic branching ratios to the ground state and orbitally excited charmed mesons $D, D^\ast$ and $D^{\ast\ast}$. We check Bjorken's sum rule and discuss the respective contributions to it. We find $\xi(w)\simeq (2/(1+w)) ^2$, resulting from the fact that the ground state wave function is Coulomb-like. We also find $\tau_{3/2}\simeq 0.5 (2/(1+w))^3$ and $\tau_{1/2}(w)\ll \tau_{3/2}(w)$. Very small branching ratios into $j=1/2$ orbitally excited $D$'s results. The overall agreement with experiment is rather good within the present accuracy which is poor for the orbitally excited charmed mesons. We predict a ratio $Br(B\to D^\ast_2 l \nu)/Br(B\to D_1 l \nu)=1.55\pm 0.15$ as a mere consequence of the heavy quark symmetry. If some faint experimental indications that $Br(B\to D_1 l \nu)\simeq Br(B\to D^\ast_2 l \nu)$ were confirmed, it would indicate a sizeable $O(1/m_c)$ correction

Possible explanation of the discrepancy of the light-cone QCD sum rule calculation of g(D*Dpi) coupling with experiment

The introduction of an explicit negative radial excitation contribution in the hadronic side of the light cone QCD sum rule (LCSR) of Belyaev, Braun, Khodjamirian and Ruckl, can explain the large experimental value of g(D*Dpi), recently measured by CLEO. At the same time, it considerably improves the stability of the sum rule when varying the Borel parameter.Comment: 9 pages, 1 PostScript figure

Critical Analysis of Theoretical Estimates for BB to Light Meson Form Factors and the B→ψK(K∗)B \to \psi K(K^{\ast}) Data

We point out that current estimates of form factors fail to explain the non-leptonic decays $B \to \psi K(K^{\ast})$ and that the combination of data on the semi-leptonic decays $D \to K(K^{\ast})\ell \nu$ and on the non-leptonic decays $B \to \psi K(K^{\ast})$ (in particular recent po\-la\-ri\-za\-tion data) severely constrain the form (normalization and $q^2$ dependence) of the heavy-to-light meson form factors, if we assume the factorization hypothesis for the latter. From a simultaneous fit to \bpsi and \dk data we find that strict heavy quark limit scaling laws do not hold when going from $D$ to $B$ and must have large corrections that make softer the dependence on the masses. We find that $A_1(q^2)$ should increase slower with \qq than $A_2, V, f_+$. We propose a simple parametrization of these corrections based on a quark model or on an extension of the \hhs laws to the \hl case, complemented with an approximately constant $A_1(q^2)$. We analyze in the light of these data and theoretical input various theoretical approaches (lattice calculations, QCD sum rules, quark models) and point out the origin of the difficulties encountered by most of these schemes. In particular we check the compatibility of several quark models with the heavy quark scaling relations.Comment: 48 pages, DAPNIA/SPP/94-24, LPTHE-Orsay 94/1

Entre nuisances et urbanisation : une méthode de lecture du bien-être : La ville industrielle de Gardanne (Bouches-du-Rhône)

International audienc

Entre nuisances et urbanisation : une méthode de lecture du bien-être : La ville industrielle de Gardanne (Bouches-du-Rhône)

International audienc

Designing distributed algorithms by means of formal sequentially phased reasoning (extended abstract)

Designers of network algorithms give elegant informal descriptions of the intuition behind their algorithms (see [GHS83, Hu83, MS79, Se82, Se83, ZS80]). Usually, these descriptions are structured as if tasks or subtasks are performed sequentially. From an operational point of view, however, they are performed concurrently. Here, we present a design principle that formally describes how to develop algorithms according to such sequentially phased explanations. The design principle is formulated using Manna and Pnueli's linear time temporal logic [MP83]. This principle, together with Chandy and Misra's technique [CM88] or Back and Sere's technique [BS89] for designing parallel algorithms, is applicable to large classes of algorithms, such as those for minimum-path, connectivity, network flow, and minimum-weight spanning trees. In particular, the distributed minimum-weight spanning tree algorithm of Gallager, Humblet, and Spira [GHS83] is structured according to our principle