Heteroclinic orbits between rotating waves of semilinear parabolic equations on the circle

We investigate heteroclinic orbits between equilibria and rotating waves for scalar semilinear parabolic reaction-advection-diffusion equations with periodic boundary conditions. Using zero number properties of the solutions and the phase shift equivariance of the equation, we establish a necessary and sufficient condition for the existence of a heteroclinic connection between any pair of hyperbolic equilibria or rotating waves.     

Current correlators to all orders in the quark masses

The contributions to the coefficient functions of the quark and the mixed quark-gluon condensate to mesonic correlators are calculated for the first time to all orders in the quark masses, and to lowest order in the strong coupling constant. Existing results on the coefficient functions of the unit operator and the gluon condensate are reviewed. The proper factorization of short- and long-distance contributions in the operator product expansion is discussed in detail. It is found that to accomplish this task rigorously the operator product expansion has to be performed in terms ofnon-normal-ordered condensates. The resulting coefficient functions are improved with the help of the renormalization group. The scale invariant combination of dimension 5 operators, including mixing with the mass operator, which is needed for the renormalization group improvement, is calculated in the leading order.Supported by the German Bundesministerium für Forschung und Technologie, under the contract 06 TM 761     

Moderate Deviations for Longest Increasing Subsequences: The Lower Tail

We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity.     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

An Enumerative Geometry for Magic and Magilatin Labellings

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.