Collinearity, convergence and cancelling infrared divergences

The Lee-Nauenberg theorem is a fundamental quantum mechanical result which provides the standard theoretical response to the problem of collinear and infrared divergences. Its argument, that the divergences due to massless charged particles can be removed by summing over degenerate states, has been successfully applied to systems with final state degeneracies such as LEP processes. If there are massless particles in both the initial and final states, as will be the case at the LHC, the theorem requires the incorporation of disconnected diagrams which produce connected interference effects at the level of the cross-section. However, this aspect of the theory has never been fully tested in the calculation of a cross-section. We show through explicit examples that in such cases the theorem introduces a divergent series of diagrams and hence fails to cancel the infrared divergences. It is also demonstrated that the widespread practice of treating soft infrared divergences by the Bloch-Nordsieck method and handling collinear divergences by the Lee-Nauenberg method is not consistent in such cases.Comment: 29 pages, 17 figure

Discounting in Games across Time Scales

We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value

Continuous Wave THz System Based on an Electrically Tunable Monolithic Dual Wavelength Y-Branch DBR Diode Laser

We analyse the use of a tunable dual wavelength Y-branch DBR laser diode for THz applications. The laser generates electrically tunable THz difference frequencies in the range between 100 and 300 GHz. The optical beats are tuned via current injection into a micro-resistor heater integrated on top of one of the distributed Bragg reflector (DBR) section of the diode. The laser is integrated in a homodyne THz system employing fiber coupled ion-implanted LT-GaAs log spiral antennas. The applicability of the developed system in THz spectroscopy is demonstrated by evaluating the spectral resonances of a THz filter as well as in THz metrology in thickness determination of a polyethylene sample

Properties of hyperons in chiral perturbation theory

The development of chiral perturbation theory in hyperon phenomenology has been troubled due to power-counting subtleties and to a possible slow convergence. Furthermore, the presence of baryon-resonances, e.g. the lowest-lying decuplet, complicates the approach, and the inclusion of their effects may become necessary. Recently, we have shown that a fairly good convergence is possible using a renormalization prescription of the loop-divergencies which recovers the power counting, is covariant and consistent with analyticity. Moreover, we have systematically incorporated the decuplet resonances taking care of both power-counting and $consistency$ problems. A model-independent understanding of diferent properties including the magnetic moments of the baryon-octet, the electromagnetic structure of the decuplet resonances and the hyperon vector coupling $f_1(0)$, has been successfully achieved within this approach. We will briefly review these developments and stress the important role they play for an accurate determination of the Cabibbo-Kobayashi-Maskawa matrix element $V_{us}$ from hyperon semileptonic decay data.Comment: To appear in HypX Proceeding

Nutritional status of Lusitano broodmares on extensive feeding systems: body condition, live weight and metabolic indicators

Articles in International JournalsThe present research aimed to evaluate the effects of foaling season and feeding management in extensive systems on the nutritional status of Lusitano broodmares throughout the gestation/lactation cycle, by assessment of body condition (BC), body weight (BW), and some blood metabolic indicators. Four groups of Lusitano broodmares (A, B, C, D) were monitored during four years, in a total of 119 gestation/lactation cycles. All mares were kept on pasture, and A and B mares were daily supplemented. Monthly, mares were weighed and BC evaluated. Suckling foals from these mares were also monitored for BW and withers height. Glucose, non-esterified fatty acids, urea and albumin concentrations were determined in blood. BW changes were influenced by reproductive stage and foaling season (P<0.001), reflecting also pasture availability. Changes on BC were observed (P<0.05), although with small amplitudes within each group. Higher scores were reached at the end of spring, decreasing 0.25 point until late summer. Early foaling had also a marked effect, hindering the recovery of BC along the cycle. Glucose values decreased from late gestation to early lactation (P<0.05) and lower levels were recorded during the summer months. Uremia was mainly influenced by the reproductive stage (P<0.05). Under nutrition was not detected. Foals born in February-March had higher average daily gain than those born in April-May (P<0.05), probably reflecting differences in milk production of the mares. BC and BW changes and, particularly, blood indicators showed an overall balanced nutritional status, reflecting an adaptation to feed availability and climate.Portuguese Foundation for Science and Technolog

Critical behavior of the planar magnet model in three dimensions

We use a hybrid Monte Carlo algorithm in which a single-cluster update is combined with the over-relaxation and Metropolis spin re-orientation algorithm. Periodic boundary conditions were applied in all directions. We have calculated the fourth-order cumulant in finite size lattices using the single-histogram re-weighting method. Using finite-size scaling theory, we obtained the critical temperature which is very different from that of the usual XY model. At the critical temperature, we calculated the susceptibility and the magnetization on lattices of size up to $42^3$. Using finite-size scaling theory we accurately determine the critical exponents of the model and find that $\nu$=0.670(7), $\gamma/\nu$=1.9696(37), and $\beta/\nu$=0.515(2). Thus, we conclude that the model belongs to the same universality class with the XY model, as expected.Comment: 11 pages, 5 figure

Analysis of path integrals at low temperature : Box formula, occupation time and ergodic approximation

We study the low temperature behaviour of path integrals for a simple one-dimensional model. Starting from the Feynman-Kac formula, we derive a new functional representation of the density matrix at finite temperature, in terms of the occupation times of Brownian motions constrained to stay within boxes with finite sizes. From that representation, we infer a kind of ergodic approximation, which only involves double ordinary integrals. As shown by its applications to different confining potentials, the ergodic approximation turns out to be quite efficient, especially in the low-temperature regime where other usual approximations fail

Algorithms for Game Metrics

Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative {\mu}-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n^4) for both turn-based games and MDPs; improving the previously best known O(n^9\cdot log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(|G|^O(|G|^5)) time complexity, improving the previously known reduction, which yielded O(|G|^O(|G|^7)) time complexity. These algorithms can be iterated to approximate the metrics using binary search.Comment: 27 pages. Full version of the paper accepted at FSTTCS 200