A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K₅₀. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Timelike Minimal Surfaces via Loop Groups

This work consists of two parts. In Part I, we shall give a systematic study of Lorentz conformal structure from structural viewpoints. We study manifolds with split-complex structure. We apply general results on split-complex structure for the study of Lorentz surfaces.In Part II, we study the conformal realization of Lorentz surfaces in the Minkowski 3-space via conformal minimal immersions. We apply loop group theoretic Weierstrass-type representation of timelike constant mean curvature for timelike minimal surfaces. Classical integral representation formula for timelike minimal surfaces will be recovered from loop group theoretic viewpoint.     

Investigation and optimization of the covering power and coloristic properties of paint coatings of complex composition

A method for finding the optimum sizes of pigment particles, their volume concentration, and the paint coating thickness that provide the covering power and the required coloristic characteristics of reflected light for the minimum flow rate of pigments is based on using a four-flow approximation of the solution to the equation of radiation transfer in dispersion media and is extended to coatings of complex composition. The capabilities of the method are demonstrated by examples of coatings of mixtures of hematite and rutile particles in a binder with n=1.5 for variations of the modal size and the half-width of the size distribution of the pigment particles. B. I. Stepanov Institute of Physics, Academy of Sciences of Belarus, 70, F. Skorina Ave., Minsk, 220072, Belarus. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 64, No. 1, pp. 90–96, January–February, 1997.