AIR Tools II: algebraic iterative reconstruction methods,improved implementation

This paper is devoted to designing a practical algorithm to invert the Laplace transform by assuming that the transform possesses the Puiseux expansion at infinity. First, the general asymptotic expansion of the inverse function at zero is derived, which can be used to approximate the inverse function when the variable is small. Second, an inversion algorithm is formulated by splitting the Bromwich integral into two parts. One is the main weakly oscillatory part, which is evaluated by a composite Gauss–Legendre rule and its Kronrod extension, and the other is the remaining strongly oscillatory part, which is integrated analytically using the Puiseux expansion of the transform at infinity. Finally, some typical tests show that the algorithm can be used to invert a wide range of Laplace transforms automatically with high accuracy and the output error estimator matches well with the true error.     

Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph

Dedicated to the memory of Paul Erdős Erdős, Hajnal and Pósa exhibited in [1] a partition (U,D) of the edges of the Rado graph which is a counterexample to . They also obtained that if every vertex of a graph has either in or in the complement of finite degree then . We will characterize all graphs so that . Received October 29, 1999 RID="†" ID="†" Supported by NSERC of Canada Grant #691325.     

Multiplicative posets

A functionf from the posetP to the posetQ is a strict morphism if for allx, y P withx we havef(x). If there is such a strict morphism fromP toQ we writeP Q, otherwise we writeP Q. We say a posetM is multiplicative if for any posetsP, Q withP M andQ M we haveP ×Q M. (Here (p ₁,q ₁)<(p ₂,q ₂) if and only ifp ₁<p ₂ andq ₁<q ₂.) This paper proves that well-founded trees with height are multiplicative posets.This research was supported in part by NSERC Grant #69-1325.     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.     

Gröbner bases, H-bases and interpolation

The paper is concerned with a construction for H-bases of polynomial ideals without relying on term orders. The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them. This allows for an extension of Buchberger's algorithm to construct these H-bases algorithmically. In addition, the close connection of this approach to minimal degree interpolation, and in particular to the least interpolation scheme due to de Boor and Ron, is pointed out.

     

Julia directions of meromorphic functions and their derivatives

We prove that if a transcendental meromorphic function has no Julia direction and is bounded on a path to ￥ \infty then there is a common Julia direction for all derivatives. Related statements are obtained under the assumption that f is o(?{ | z | }) o(\sqrt{\mid z \mid}) or O(?{ | z | }) O(\sqrt{\mid z \mid}) on a path to ￥ \infty . Further we disprove a conjecture of Frank and Wang by means of a counterexample.     

Integral foliated simplicial volume of aspherical manifolds

Simplicial volumes measure the complexity of fundamental cycles of manifolds. In this article, we consider the relation between the simplicial volume and two of its variants — the stable integral simplicial volume and the integral foliated simplicial volume. The definition of the latter depends on a choice of a measure preserving action of the fundamental group on a probability space.     

Wavelets for multichannel signals

In this paper, we introduce and investigate multichannel wavelets, which are wavelets for vector fields, based on the concept of full rank subdivision operators. We prove that, like in the scalar and multiwavelet case, the existence of a scaling function with orthogonal integer translates guarantees the existence of a wavelet function, also with orthonormal integer translates. In this context, however, scaling functions as well as wavelets turn out to be matrix-valued functions.     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.