The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.     

Probing microscopic chaotic dynamics by observing macroscopic transport processes

We derive the Kramers equation, namely, the Fokker-Planck equation for an oscillator, from a completely deterministic picture. The oscillator is coupled to a “booster”, i.e., a deterministic system in a fully chaotic state, wherein diffusion is derived from the sensitive dependence of chaos on initial conditions and friction is a consequence of the linear response of the booster to the action exerted on it by the oscillator. To deal with the Hamiltonian nature of the system of interest and of its coupling to the booster, we extend the earlier theoretical derivation of macroscopic transport coefficients from deterministic dynamics. We show that the frequency of the oscillator can be tuned to the microscopic frequencies of the booster without affecting the canonical nature of the “macroscopic” statistics. The theoretical predictions are supported by numerical simulations.     

Size,chromatic number,and connectivity

We consider the minimum number of edges in ak-edge-connected graph of ordern with chromatic number at leastc, obtaining the optimal bounds in most cases.     

Book Review:Brownian Agents and Active Particles. F. Schweitzer,Springer, Berlin, 2003

Journal of Statistical Physics -     

Future contributions toJournal of Crystallographic and Spectroscopic Research

Future contributions toJournal of Crystallographic and Spectroscopic Research     

Three New Diarylpropanes from Dioscorea composita

Three new diarylpropanes were isolated from the dried rhizomes of Dioscorea composita Hemsl., and their structures were determined as 1, 3-bis-(2-hydroxy-4-methoxyphenyl) propane (1), 1, 3-bis-(2, 4-dihydroxyphenyl)propane (2), 1-(2′-hydroxy-4′-O-β-D- glucopymnosy-phenyl)-3-(2“, 4“-dihydroxyphenyl)propane (3), by spectroscopic analysis, respectively.     

Aggregated colloids under flow

Summary We have recently reported on a new scaling theory of the rupture of colloid aggregates. The scaling theory is compared with a simulation study of the transient response of sheared 2d aggregates. In this paper we discuss the origins of deviations from the predicted scaling behaviour. We also report some of the steady-state configurations formed post rupture. Paper presented at the I International Conference on Scaling Concepts and Complex Fluids, Copanello, Italy, July 4–8, 1994.     

Pattern formation in diffusion-limited reactions

The conditions for macroscopic segregation ofA andB in a steady-stateA+B 0 reaction are studied in infinite systems. Segregation occurs in one and two dimensions and is marginal ford=3. We note the dependence of these results on the precise experimental conditions assumed in the theory. We also note the difference between these results and our earlier ones for finite systems where the critical dimension isd=2.     

Networks and chain coverings in partial orders and their products

For an arbitrary poset P, subposets {P _i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.