Integral representations combining ladders and crossed-ladders

We use the worldline formalism to derive integral representations for three classes of amplitudes in scalar field theory: (i) the scalar propagator exchanging N momenta with a scalar background field (ii) the "half-ladder" with N rungs in x - space (iii) the four-point ladder with N rungs in x - space as well as in (off-shell) momentum space. In each case we give a compact expression combining the N! Feynman diagrams contributing to the amplitude. As our main application, we reconsider the well-known case of two massive scalars interacting through the exchange of a massless scalar. Applying asymptotic estimates and a saddle-point approximation to the N-rung ladder plus crossed ladder diagrams, we derive a semi-analytic approximation formula for the lowest bound state mass in this model.Comment: 39 pages, 10 pdf figure

The economic value of adding capacity at airports – a data-driven model

This article presents a model for the economic value of adding capacity at airports. We start with an extensive literature review, discussing the main findings covering costs and revenues at airports, in particular related to their capacity. We then proceed to an analysis based on a wide range of data sources (financial, operational, quality of service) which have been synthesised into one database. The analysis itself yields interesting results, such as the presence of distinct types of airport and their characteristics. Broadly based on the knowledge gained from the data analysis, we describe a functional model describing the costs and revenues associated with an increase of capacity at an airport. We show how the model can be calibrated with data and present some preliminary results based on the calibration of Paris Charles de Gaulle airport

The Euler-Heisenberg Lagrangian beyond one loop

We review what is presently known about higher loop corrections to the Euler-Heisenberg Lagrangian and its Scalar QED analogue. The use of those corrections as a tool for the study of the properties of the QED perturbation series is outlined. As a further step in a long-term effort to prove or disprove the convergence of the N photon amplitudes in the quenched approximation, we present a parameter integral representation of the three-loop Euler-Heisenberg Lagrangian in 1+1 dimensional QED, obtained in the worldline formalism.Comment: 11 pages, 2 figures, talk given by Christian Schubert at QFEXT11, Benasque, Spain, Sept. 18-24, 2011, to appear in the conference proceeding

Verification of PCP-Related Computational Reductions in Coq

We formally verify several computational reductions concerning the Post correspondence problem (PCP) using the proof assistant Coq. Our verifications include a reduction of a string rewriting problem generalising the halting problem for Turing machines to PCP, and reductions of PCP to the intersection problem and the palindrome problem for context-free grammars. Interestingly, rigorous correctness proofs for some of the reductions are missing in the literature

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea consists in computing a bisimulation by exploring reachable pairs symbolically, so as to avoid redundancies. This idea can be combined with already existing optimisations, and we show in particular a nice integration with the disjoint sets forest data-structure from Hopcroft and Karp's standard algorithm. Then we consider Kleene algebra with tests (KAT), an algebraic theory that can be used for verification in various domains ranging from compiler optimisation to network programming analysis. This theory is decidable by reduction to language equivalence of automata on guarded strings, a particular kind of automata that have exponentially large alphabets. We propose several methods allowing to construct symbolic automata out of KAT expressions, based either on Brzozowski's derivatives or standard automata constructions. All in all, this results in efficient algorithms for deciding equivalence of KAT expressions