917 resultados para Computational lambda-calculus
Resumo:
By using techniques of unitarized chiral perturbation theory, where the Lamda(1405) and Lamda(1670) resonances are dynamically generated, we evaluate the magnetic moments of these resonances and their transition magnetic moment. The results obtained here differ appreciably from those obtained with existing quark models. The width for the Lamda(1670)->Lamda(1405)gamma transition is also evaluated, leading to a branching ratio of the order of 210-6.
Resumo:
We reanalyze the decay mode of Lambda hypernuclei induced by two nucleons modifying previous numerical results and the interpretation of the process. The repercussions of this channel in the ratio of neutron to proton induced Lambda decay is studied in detail in connection with the present experimental data. This leads to ratios that are in greater contradiction with usual one pion exchange models than those deduced before.
Resumo:
We use the recently obtained theoretical expression for the complete QCD static energy at next-to-next-to-next-to leading-logarithmic accuracy to determine r(0)Lambda((MS) over bar) by comparison with available lattice data, where r(0) is the lattice scale and Lambda((MS) over bar) is the QCD scale. We obtain r(0)Lambda((MS) over bar) = 0.622(-0.015)(+0.019) for the zero-flavor case. The procedure we describe can be directly used to obtain r(0)Lambda((MS) over bar) in the unquenched case, when unquenched lattice data for the static energy at short distances becomes available. Using the value of the strong coupling alpha(s) as an input, the unquenched result would provide a determination of the lattice scale r(0).
Resumo:
A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics, and is a variant of the perfect phylogeny haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is "full" genotypes, here we assume less informative input, and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time, by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by that tree they map onto, and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes, and present a linear algorithm for identifying those genotypes.