The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Spline prewavelets for non-uniform knots

Summary In this paper, we develop a framework suitable for performing a multiresolution analysis using univariate spline spaces of arbitrary degree and with non-uniform knot-sequences. To this end, we show, among other things, the existence of compactly supported prewavelets and of prewavelets that are globally supported, but decay exponentially. In each case we obtain a decomposition of a fine spline space as a sum of a coarse spline space plus a spline space spanned by prewavelets.     

Spline collocation for strongly elliptic equations on the torus

Summary We prove convergence and error estimates in Sobolev spaces for the collocation method with tensor product splines for strongly elliptic pseudodifferential equations on the torus. Examples of applications include elliptic partial differential equations with periodic boundary conditions but also the classical boundary integral operators of potential theory on torus-shaped domains in three or more dimensions. For odd-degree splines, we prove convergence of nodal collocation for any strongly elliptic operator. For even-degree splines and midpoint collocation, we find an additional condition for the convergence which is satisfied for the classical boundary integral operators. Our analysis is a generalization to higher dimensions of the corresponding analysis of Arnold and Wendland [4].     

Diffusive clustering in an infinite system of hierarchically interacting diffusions

Summary We study a countable system of interacting diffusions on the interval [0,1], indexed by a hierarchical group. A particular choice of the interaction guaranties, we are in the diffusive clustering regime. This means clusters of components with values either close to 0 or close to 1 grow on various different scales. However, single components oscillate infinitely often between values close to 0 and close to 1 in such a way that they spend fraction one of their time together and close to the boundary. The processes in the whole class considered and starting with a shift-ergodic initial law have the same qualitative properties (universality).     

Incomplete data problems in X-ray computerized tomography

Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4     

A generic view of Dantzig-Wolfe decomposition in mixed integer programming

The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques.