نتایج جستجو برای: lattice matching
تعداد نتایج: 193849 فیلتر نتایج به سال:
A number of old and new methods for computing K → ππ amplitudes on the lattice are reevaluated. They all involve a non-perturbative determination of matching coefficients. I will show how problems related to operator mixing can be greatly reduced by introducing the O.P.E. of hadronic currents directly on the lattice. Applications to the evaluation of CP-symmetric (∆I = 1/2 rule) and CP-violatin...
We review our perturbative techniques for improved heavy quark actions. A new procedure for computing improvement coefficients is suggested, where the continuum limit of a lattice-regularized theory provides the matching conditions.We also use a gauge-invariant infrared regulator that is well suited to higher-order calculations in lattice gauge theory. We report on preliminary tests of our meth...
ABSTRACT This paper analyzes a pentanomial lattice model for option pricing that incorporates skewness and kurtosis of the underlying asset. The lattice is constructed using a moment matching procedure, and explicit positivity conditions for branch probabilities are provided in terms of skewness and kurtosis. We also explore the limiting distribution of this lattice, which is compound Poisson, ...
We compute the matching conditions between lattice and continuum 3-D SU(N) Higgs theories, with both adjoint and fundamental scalars, at O(a), except for additive corrections to masses and φ insertions. PACS numbers: 11.15.Ha, 11.15.Kc
Lattice studies of hadronic matrix elements require matching between operators in full continuum QCD and those in the lattice theory being simulated. In the present article we will focus on an effective lattice theory which combines nonrelativistic (NRQCD) heavy quarks and clover light quarks. We wish to match the theories correct through O( p M , α p M , α ap). For heavy meson (e.g. B and B∗) ...
Existence of von Neumann–Morgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party payments and form a lattice with respect to the same partial order usually defined on the core.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید