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.     

Quantitative Depth Profiling of K-Doped Fullerene Films Using XPS and SIMS

 Phenomena accompanying electrochemical doping of solid fullerene films with potassium were studied by sputter ion depth profiling (XPS and SIMS). The potassium distribution was determined, and artifacts associated with possible damage of the layer composition caused by ion impact were investigated and discussed. To compare the charge transfer while reductive doping is taking place at fullerene/solution interface with doping from gas phase, model layers were prepared and doped by potassium under UHV conditions. It was found that sputtering by Ar⁺ primary ions yields both accurate information on the alkaline metal distribution and on its concentration. Sputtering by O⁺ ions led to an enrichment of potassium, apparently due to the reactivity of oxygen with the fullerene matrix. It is shown that the reductive doping starts at the fullerene/solution interface. The concentration of potassium in the doped films was found to be lower than expected from the charge transferred during the electrochemical reduction. Other phase transformations such as hydrogenation are discussed. Received March 4, 2002; accepted July 26, 2002     

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     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.