Testing Extreme Value Conditions

A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution.     

Quark masses from regularized integrals of vector current spectral functions

We give estimates of quark masses from a comparison of two methods of regularizing the coefficient of the Schwinger term. The masses of the first radial excited states of ?, ω, and ? would have to be slightly higher than indicated by the new Orsay data for this method to yield real solutions for the masses of theu, d, ands quarks.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

A trajectory-following method for unconstrained optimization

A trajectory-following method with interesting properties is considered for solving unconstrained nonlinear programming problems. The trajectory is defined by a special system of ordinary differential equations. This system uses only the gradient of the objective function. Numerical examples are given.The work of the second author was supported by the DFG Schwerpunkt Anwendungs-bezogene Optimierung and Steuerung.     

Comparison theorems for weak splittings of bounded operators

Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502     

First passage percolation: The stationary case

Summary If the passage time of the edges of the ^d lattice are stationary, ergodic and have finite moment of orderp>d, then a.s. the set of vertices that can be reached within timet, has an asymptotic shape ast.