KT-nearfields of rank 2

Summary Nearfields of rank 2 over their kernel which are not Dickson nearfields have recently been constructed by H. Zassenhaus. Here it is shown that KT-nearfields of rank 2 over their kernels and of characteristic 2 are necessarily Dickson nearfields which are coupled to quadratic field extensions and their Dickson group is isomorphic to ₂. Using results of Gröger one obtains all KT-nearfields of rank 2 over the field of rational numbers.     

On the support of midconvex operators

Summary LetX be a real vector space,D a convex subset ofX and (Y, K) an order complete ordered vector space. The following sandwich theorem holds: Iff: D Y is midconvex,g: D Y {– } is midconcave andg f onD, then there exists a Jensen mappingh: D Y {– } such thatg h f onD. Using this theorem we show that a mappingf: D Y is midconvex if and only if it has Jensen support at every point ofD. Moreover, ifX is a Baire topological vector space and (Y, K) is an ordered topological vector space satisfying some additional conditions, then a mappingf: D Y is continuous whenever it has continuous Jensen support at every point ofD. As an application of these results we obtain the equality of some set-classes connected with additive and midconvex operators.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Some regularity properties of algorithms and additive functions with respect to them

Summary The paper deals with the behaviour of the so-called algorithms with respect to interval filling sequences A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

On an alternative cauchy equation in two unknown functions. Some classes of solutions

Summary In this paper we consider the alternative Cauchy functional equationg(xy) g(x)g(y) impliesf(xy) = f(x)f(y) wheref, g are functions from a topological group (X, ·) into a group (S,·). First we prove that, ifS is a Hausdorff topological group andX satisfies some weak additional hypotheses, then (f, g) is a continuous solution if and only if eitherf org is a homomorphism. Then we describe a more general class of solutions forX =R ⁿ .Partially supported by M.U.R.S.T. Research funds (40%)Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.     

Repleteness and regular lattice measures

Let X be an abstract set and L a lattice of subsets of X. To each lattice regular measure µ, we associate two induced measures and on suitable lattices of the Wallman space IR(L) and another measure µ on the spaceIR(L). We will investigate the reflection of smoothness properties of p onto , and µ; and try to set some new criterion for repleteness and measure repleteness.     

The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

The left-definite Legendre type boundary problem

The left-definite Legendre type boundary problem concerns the study of a fourth-order singular differential expressionM _k [–] in a weighted Sobolev spaceH generated by a Dirichlet inner product. The fourth-order differential equation

The number oft-wise balanced designs

We prove that the number oft-wise balanced designs of ordern is asymptotically , provided that blocks of sizet are permitted. In the process, we prove that the number oft-profiles (multisets of block sizes) is bounded below by and above by for constants c₂>c₁>0.     

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

Rates of convergence of α-stable random motions

The rate-of-convergence problem in the central limit theorem is considered for -stable distributions on the noncommutative group of motions in ^d. The method used here is based on the theory of probability metrics.