Counting unrooted maps on the plane

A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps.     

Chemical analysis and distribution investigation of trace elements in indium matrix by spark source mass spectrometry

Summary High-purity indium was analysed by spark source mass spectrometry, using electrical and photoplate detection. For the calibration of the differences in elemental sensitivity, a standard sample was prepared in which 10 impurities were determined by graphite furnace atomic absorption spectrometry. In this way accuracies of less than 40% were obtained for relatively homogeneous elements at ppm and sub-ppm level. About 40 elements could be determined with detection limits of 10 to 30 ppb. Two pattern recognition methods, principal component analysis and clustering analysis, were applied to obtain information on trace element distribution, which indicated that a number of elements were strongly spatially correlated in the analysed sample.

---

Chemische Analyse und Verteilungsbestimmung von Spurenelementen in Indium-Matrix durch Funkenquellen-Massenspektrometrie

---

On leave from: Department of Chemistry, Nanjing Normal University, Nanjing, People's Republic of China     

Lot-sizing with fixed charges on stocks: the convex hull

In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems.

Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany et al. (Math. Programming Stud. 22 (1984) 32) for the uncapacitated lot-sizing problem. The convex hull proof is based on showing that an extended facility location formulation is tight and by projecting it onto the original space of variables.     

Charge manipulation and imaging of the Mn acceptor state in GaAs by cross-sectional scanning tunneling microscopy

An individual Mn acceptor in GaAs is mapped by cross-sectional scanning tunneling microscopy (X-STM) at room temperature and a strongly anisotropic shape of the acceptor state is observed. An acceptor state manifests itself as a cross-like feature which we attribute to a valence hole weakly bound to the Mn ion forming the (Mn²⁺3d⁵+hole) complex. We propose that the observed anisotropy of the Mn acceptor wavefunction is due to the d-wave present in the acceptor ground state.     

Relevance of Reflection in Static and Dynamic Light Scattering Experiments

Using a monodisperse PMMA dispersion, it was shown that light reflection at the sample cuvette walls may greatly influence the results of both static (SLS) and dynamic (DLS) light scattering experiments. Considering SLS, this reflection phenomenon mostly causes an overestimation of the scattered intensity at high scattering angles, which may give rise to the emergence of an additional, artificial peak in the lower region of the particle size distribution. On the other hand, the influcence of reflection on DLS measurements was shown to be particularly important in the upper region of the particle size distribution. The experimentally observed phenomena were explained from the basic principles of both particle sizing methods. Finally, it was shown that the disturbing effect of reflection could be avoided by modifying either the hardware or the software of the static and dynamic light scattering technique.     

The core of discontinuous games

The traditional design of cooperative games implicitly assumes that preferences are continuous. However, if agents implement tie breaking procedures, preferences are effectively lexicographic and thus discontinuous. This rouses concern over whether classic core nonemptiness theorems apply in such settings. We show that balanced NTU games may have empty cores when agents have discontinuous preferences. Moreover, exchange economies may lack coalitionally rational trades when consumers implement tie breaking rules, even if these rules are themselves continuous and convex as are all first order preferences. Results are more positive when “utility” is transferable. We prove that balancedness is necessary and sufficient to ensure a nonempty core in lexicographic TU games.     

On worst-case aggregation analysis for network location problems

Network location problems occur when new facilities must be located on a network, and the network distances between new and existing facilities are important. In urban, regional, or geographic contexts, there may be hundreds of thousands (or more) of existing facilities, in which case it is common to aggregate existing facilities, e.g. represent all the existing facility locations in a zip code area by a centroid. This aggregation makes the size of the problem more manageable for data collection and data processing purposes, as well as for purposes of analysis; at the same time, it introduces errors, and results in an approximating location problem being solved. There seems to be relatively little theory for doing aggregation, or evaluating the results of aggregation; most approaches are based on experimentation or computational studies. We propose a theory that has the potential to improve the means available for doing aggregation.This research was supported in part by the National Science Foundation, Grant No. DDM-9023392.