We calculate the leading divergences at NNLO for the octet part of the nonleptonic weak sector of chiral perturbation theory, using renormalization group methods. The role of counterterms which vanish at the equation of motion and their use to simplify the calculation is shown explicitly. The obtained counterterm Lagrangian can be employed to calculate the chiral double log contributions of qua...

5 A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) 6 of a sequence of simple closed curves. We describe an algorithm to determine whether 7 a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, 8 improving an earlier O(n3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As 9 an immediate corollary, we obtain the fir...

Computer algebra algorithms are developed for evaluating the oeÆ ients in Airy-type asymptoti expansions that are obtained from integrals with a large parameter. The oeÆ ients are de ned from re ursive s hemes obtained from integration by parts. An appli ation is given for the Weber paraboli ylinder fun tion. 2000 Mathemati s Subje t Classi ation: 41A60, 33C10, 33C15, 33F05, 65D20.

Boschen and Weise (Journal of Money, Credit and Banking, 2003) model the probability of a large upturn in in‡ation. We extend their work to show that openness to trade exerts a negative e¤ect on the probability of such an event. Keywords: In‡ation starts, trade openness. JEL classi…cation: E31, F41.

The title compound, C(18)H(33)N(3)O(5), was prepared from N-tert-butoxy-carbonyl-4-piperidone using a nine-step reaction, including condensation, methyl-ation, oximation, hydrolysis, esterification, ammonolysis, Hoffmann degradation, tert-butoxy-carbonyl protection and methyl-ation. The E configuration of the methyl-oxime geometry of the compound is confirmed.

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...

Let the summatory function of the Möbius function be denoted M(x). We deduce in this article conditional results concerning M(x) assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the Riemann zeta function. The main results shown are that the weak Mertens conjecture and the existence of a limiting distribution of e−y/2M(ey) are consequences of the af...

A weak e-net for a set of points M, is a set of points W (not necessarily in M) where every convex set containing eiMI points in M must contain at least one point in W. Weak e-nets have applications in diverse areas such as computational geometry, learning theory, optimization and statistics. Here we show that, if M is a set of points quasi-uniformly distributed on a unit sphere sd-l, then ther...