Multiplicities of interpoint distances in finite planar sets

What is the maximum number of unit distances between the vertices of a convex n-gon in the plane? We review known partial results for this and other open questions on multiple occurrences of the same interpoint distance in finite planar subsets. Some new results are proved for small n. Challenging conjectures, both old and new, are highlighted.     

Studies of the kinetics of the reduction of chromate by glutathione and related thiols

The reduction of chromate by glutathione, its mono- and diethyl esters, -cysteine, 2-mercapto-propionic acid and mercapto-succinic acid has been studied. The empirical rate law k_obs = ab[Thiol]²/(1 + b[Thiol]) is obeyed by all of these thiols, at neutral pH. No evidence could be obtained for a first-order pathway in glutathione under these conditions. These observations are used to comment on the stability of intermediates potentially important in explaining chromate toxicity.     

Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.     

An abstract Szeg? theorem

Given a semi-group U(t) of bounded linear operators with bounded self-adjoint generator A we estimate the logarithm of the section determinants of U(t) in terms of A. When A is subject to an additional condition, which is related to so-called Følner sequences of orthogonal projections, this estimate implies a Szeg? type theorem for bounded, self-adjoint, and strictly positive operators. We show that the condition mentioned is satisfied when A is a Toeplitz operator or a compact operator.     

Embedding partial Steiner triple systems so that their automorphisms extend

It is shown that there is a function g on the natural numbers such that a partial Steiner triple system U on u points can be embedded in a Steiner triple system V on ν points, in such a way that all automorphisms of U can be extended to V, for every admissible ν satisfying ν > g(u). We find exponential upper and lower bounds for g. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

An existence theorem for neutral variational problems of Bolza

This note proves an existence theorem for a generalized Bolza-type problem that has time delays in both the state and velocity variables. The assumptions are stated in terms of a modification of the classical Hamiltonian, and extend ideas of Rockafellar to the delay case.