Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Dubrovin valuation rings and Henselization

Supported in part by the National Science Foundation     

Particle ratios from a chiral SU(3) model

The measured particle ratios in central heavy-ion collisions are investigated within a chemical and thermal equilibrium chiral SU(3) σ?ω approach. Contrary to the commonly adopted non-interacting gas calculations, the chiral SU(3) model predicts modified effective hadron masses and effective chemical potentials in the medium and a transition to a chirally restored phase at high temperatures or chemical potentials. the influence of three different types of phase transitions is investigated. We show that the deduced freeze-out values considerably depend on the underlying model while the quality of the fit is approximately the same.     

Singular terms of helicity amplitudes at one loop in QCD and the soft limit of the cross sections of multi-parton processes

We describe a general method that enables us to obtain all the singular terms of helicity amplitudes of n-parton processes at one loop. The algorithm uses helicity amplitudes at tree level and simple color algebra. We illustrate the method by calculating the singular part of the one-loop helicity amplitudes of all 2 → 3 parton subprocesses. The results are used to derive the soft gluon limit of the cross sections of all 2 → 4 parton scattering subprocesses which provide a useful initial condition for the angular ordering approximation to coherent multiple soft gluon emission, incorporated in existing Monte Carlo simulation programs.     

Iterative regularization methods for atmospheric remote sensing

In this paper we present different inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber's method (LwM), the iteratively regularized Gauss-Newton method, and the conventional and regularizing Levenberg-Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg-Marquardt solution are proposed. The numerical performance of the methods is studied by means of simulations. Results are presented for an inverse problem in atmospheric remote sensing, i.e., temperature sounding with an airborne uplooking high-resolution far-infrared spectrometer.     

On two theorems for flat,affine group schemes over a discrete valuation ring

We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation ring, in a slightly more general context.     

Pushing Squares Around

We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are allowed to slide along or rotate about one another. That is, we show that any two connected configurations of the same number of modules can be transformed into each other by a sequence of moves so that all intermediate configurations are connected. This settles a conjecture formulated in [6].     

Baer orderings with noninvariant valuation ring

We construct division algebras with involution containing a Baer ordering with noninvariant order ring. This gives a negative answer to a question of Holland, whether the order ring is always invariant under inner automorphisms. Furthermore, we give examples of any index. Previously, the only known examples of division algebras containing Baer orderings were of index 2 ⁿ or of indexp forp a prime of the form 4m + 3. Supported in part by the National Science Foundation.