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.     

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.     

On computing the entropy of the Henon attractor

In a recent article D. Ruelle [inLecture Notes in Physics, No. 80 (Springer, Berlin, 1978)] has conjectured that for the Hénon attractor its measure theoretic entropy should be equal to its characteristic exponent. This result is known to be true for systems which satisfy Smale's Axiom A. In this article we report the results of our computations which suggest that Ruelle's conjecture may be true for the Hénon attractor. Further, in our study we are confronted with fundamental questions which suggest that certain existence theorems from ergodic theory are not sufficient from a computational point of view.     

An Adaptive Algorithm for Vector Partitioning

The vector partition problem concerns the partitioning of a set A of n vectors in d-space into p parts so as to maximize an objective function c which is convex on the sum of vectors in each part. Here all parameters d, p, n are considered variables. In this paper, we study the adjacency of vertices in the associated partition polytopes. Using our adjacency characterization for these polytopes, we are able to develop an adaptive algorithm for the vector partition problem that runs in time O(q(L)v) and in space O(L), where q is a polynomial function, L is the input size and v is the number of vertices of the associated partition polytope. It is based on an output-sensitive algorithm for enumerating all vertices of the partition polytope. Our adjacency characterization also implies a polynomial upper bound on the combinatorial diameter of partition polytopes. We also establish a partition polytope analogue of the lower bound theorem, indicating that the output-sensitive enumeration algorithm can be far superior to previously known algorithms that run in time polynomial in the size of the worst-case output.     

Uniqueness and asymptotic behaviour for solutions of semilinear problems with boundary blow-up

In this paper we prove uniqueness of positive solutions to logistic singular problems , , 1$">, 0$"> in , where the main feature is the fact that . More importantly, we provide exact asymptotic estimates describing, in the form of a two-term expansion, the blow-up rate for the solutions near . This expansion involves both the distance function and the mean curvature of .

     

Powers of Euler's Product and Related Identities

Ramanujan's partition congruences can be proved by first showing that the coefficients in the expansions of (q; q) ^r satisfy certain divisibility properties when r = 4, 6 and 10. We show that much more is true. For these and other values of r, the coefficients in the expansions of (q; q) ^r satisfy arithmetic relations, and these arithmetic relations imply the divisibility properties referred to above. We also obtain arithmetic relations for the coefficients in the expansions of (q; q) ^r (q ^t; q ^t) ^s , for t = 2, 3, 4 and various values of r and s. Our proofs are explicit and elementary, and make use of the Macdonald identities of ranks 1 and 2 (which include the Jacobi triple product, quintuple product and Winquist's identities). The paper concludes with a list of conjectures.