The second-order dynamic phase transition and Lee--Yang zeros in Eggers urn model

A second-order dynamic phase transition in a non-equilibrium Eggers urn model for the separation of sand is studied. The order parameter, the susceptibility and the stationary probability distribution have been calculated. By applying the Lee-Yang zeros method of equilibrium phase transitions, we study the distributions of the effective partition function zeros and obtain the same result for the model. Thus, the Lee-Yang theory can be applied to a more general non-equilibrium system.     

Boundary coupled dual-equation numerical simulation on mass transfer in the Process of laser cladding

The coupled numerical simulation on fluid flow, heat transfer, and mass transfer in the process of laser cladding is undertaken on the basis of the continuum model.In the simulation of mass transfer in the laser molten pool, the concentration distribution in the regions on different sides of the interface between cladding layer and substrate is calculated separately and coupled at the co-boundary.The non-equilibrium solute partition coefficient is obtained from equilibrium solute partition coefficient according to the Sobolev model.By using the developed software which is based on the commercial software PHOENICS 1.4, the distribution of Fe in laser molten pool in an experiment of cladding Stellite 6 on 12CrMoV is calculated.The obtained results well coincide with the experimental ones.     

New weighted Rogers-Ramanujan partition theorems and their implications

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets of theorems - a set of three theorems involving partitions into parts (mod 6), and a set of three theorems involving partitions into parts (mod 7), .

     

Comparison of solubility of gases and vapours in wet and dry alcohols,especially octan‐1‐ol

Equations for the solubility of gases and vapours into dry alcohols from methanol to decan‐1‐ol and into water‐saturated alcohols from butan‐1‐ol to decan‐1‐ol have been compared through the use of the Abraham solvation equation. It is shown that there are noticeable differences in solvation into the dry and wet alcohols, and that these differences become larger as the alcohols become smaller and take up more water. The two main factors that lead to the differences in solvation are the solute hydrogen‐bond basicity, B, and solute size, L. Increase in solute hydrogen‐bond basicity favours the wet alcohols and increase in solute size favours the dry alcohols. Solute hydrogen‐bond acidity plays no part, because the hydrogen‐bond basicity of water, wet alcohols and dry alcohols is almost the same. Copyright © 2008 John Wiley & Sons, Ltd.     

一类描述混沌映射的符号动力系统

本文定义了符号空间上的拟移位映射,并用该类映射描述了Ｃａｎｔｏｒ集及平面Ｃａｎｔｏｒ集上的混沌映射,本文结果可看作Ｓｍａｌｅ马蹄模型的简化。     

A Basis for the Top Homology of a Generalized Partition Lattice

For a fixed positive integer k, consider the collection of all affine hyperplanes in n-space given by xi – xj = m, where i, j [n], i j, and m {0, 1,..., k}. Let Ln,k be the set of all nonempty affine subspaces (including the empty space) which can be obtained by intersecting some subset of these affine hyperplanes. Now give Ln,k a lattice structure by ordering its elements by reverse inclusion. The symmetric group Gn acts naturally on Ln,k by permuting the coordinates of the space, and this action extends to an action on the top homology of Ln,k. It is easy to show by computing the character of this action that the top homology is isomorphic as an Gn-module to a direct sum of copies of the regular representation, CGn. In this paper, we construct an explicit basis for the top homology of Ln,k, where the basis elements are indexed by all labelled, rooted, (k + 1)-ary trees on n-vertices in which the root has no 0-child. This construction gives an explicit Gn-equivariant isomorphism between the top homology of Ln,k and a direct sum of copies of CGn.     

Homotopy of Non-Modular Partitions and the Whitehouse Module

We present a class of subposets of the partition lattice _n with the following property: The order complex is homotopy equivalent to the order complex of _n – 1, and the S _n -module structure of the homology coincides with a recently discovered lifting of the S _n – 1-action on the homology of _n – 1. This is the Whitehouse representation on Robinson's space of fully-grown trees, and has also appeared in work of Getzler and Kapranov, Mathieu, Hanlon and Stanley, and Babson et al.One example is the subposet P _n ⁿ – 1 of the lattice of set partitions _n , obtained by removing all elements with a unique nontrivial block. More generally, for 2 k n – 1, let Q _n ^k denote the subposet of the partition lattice _n obtained by removing all elements with a unique nontrivial block of size equal to k, and let P _n ^k = _{i = 2} ^k Q _n ⁱ . We show that P _n ^k is Cohen-Macaulay, and that P _n ^k and Q _n ^k are both homotopy equivalent to a wedge of spheres of dimension (n – 4), with Betti number . The posets Q _n ^k are neither shellable nor Cohen-Macaulay. We show that the S _n -module structure of the homology generalises the Whitehouse module in a simple way.We also present a short proof of the well-known result that rank-selection in a poset preserves the Cohen-Macaulay property.     

CALCULUS ON CANTOR TRIADIC SET （Ⅱ）—EXCEPTIONAL SET

In this paper the derivative and its exceptional set according to the alternatively jumping function and self-similar function respectively are discussed. And in the appendix, a proof of the statement 1.2(2) of “Calculus on Cantor triadic set (Ⅱ)—derivative” which is important to the discussion of exceptional set is given.     

Counterexamples in measuring the distance between binary trees

Examples are given to show that the closest partition distance measure need not agree with the nearest neighbor interchange distance for unordered labeled binary trees. Proposed algorithms for computing the closest partition distance are shown to be of exponential complexity and hence may not be useful in approximating the nearest neighbor interchange distance.