The cardinality of manifold atlases

It is shown that any finite dimensionalC ⁰ manifold (connected and Hausdorff but otherwise unrestricted) has an atlas of cardinality not greater than that of the continuum; while if it has a Hölder continuous pseudo-Riemannian metric then there is a countable atlas.     

Structure of solid monolayers and multilayers of n -hexane on graphite

We present all-atom molecular dynamics simulations ofn-hexane on the basal plane of graphite at monolayer and multilayer coverages. In keeping with experimental data, we find the presence of ordered adsorbed layers both at single monolayer coverage and when the adsorbed layer coexists with excess liquid adsorbate. Using a simulation method that does not impose any particular periodicity on the adsorbed layer, we quantitatively compare our results to the results of neutron diffraction experiments and find a structural transition from a uniaxially incommensurate lattice to a fully commensurate structure on increasing the coverage from a monolayer to a multilayer. The zig-zag backbone planes of all the alkane molecules lie parallel to the graphite surface at the multilayer coverage, while a few molecules are observed to attain the perpendicular orientation at monolayer coverage. Dedicated to Professor C N R Rao on his 70th birthday     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.     

On the convergence of Newton's method when estimating higher dimensional parameters

In this paper, we consider the estimation of a parameter of interest where the estimator is one of the possibly several solutions of a set of nonlinear empirical equations. Since Newton's method is often used in such a setting to obtain a solution, it is important to know whether the so obtained iteration converges to the locally unique consistent root to the aforementioned parameter of interest. Under some conditions, we show that this is eventually the case when starting the iteration from within a ball about the true parameter whose size does not depend on n. Any preliminary almost surely consistent estimate will eventually lie in such a ball and therefore provides a suitable starting point for large enough n. As examples, we will apply our results in the context of M-estimates, kernel density estimates, as well as minimum distance estimates.     

Skein related links in 3-manifolds

This paper addresses two problems in the skein theory of homotopy spheres first posed by P. Traczyk. Solutions to both problems are obtained for a large class of manifolds and, since one of the basic techniques used requires the first homology group of the ambient manifold to be torsion free, the extent to which this hypothesis is actually necessary is further explored.     

Some New Results on Key Distribution Patterns and Broadcast Encryption

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families.