In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains

The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Adsorption isotherms-Microscopic modelling: Part II

A lattice formahsm using "spin variables" is employed to analyse multi-state models for the adsorption of neutral dipoles.In particular, a spin-1/2 (two-state) model incorporating permanent and reduced dipole moments of the solvent and the organic adsorbate,substrate interactions, and &screteness of charge effects is analysed The resulting Generalized Islng Hamaltonian is solved under mean field approximation (MFA) in order to derive the adsorption isotherm for organic molecules A few spin-1 (three-state) models are also analysed under MFA to describe the competitive adsorption of multi-state solvent and organic dipoles, and the appropriate equilibrium relations are derived The unification and isomorphism existing at the Hamlltonlan level for several diverse realizations, such as adsorption of ions and solvent/orgamc molecules, is indicated The possibility of analysing phase transitions using this generalized approach is briefly indicated.

The Noether-Lefschetz theorem for the divisor class group

Let X be a normal projective threefold over a field of characteristic zero and vertical bar L vertical bar be a base-point free, ample linear system on X. Under suitable hypotheses on (X, vertical bar L vertical bar), we prove that for a very general member Y is an element of vertical bar L vertical bar, the restriction map on divisor class groups Cl(X) -> Cl(Y) is an isomorphism. In particular, we are able to recover the classical Noether-Lefschetz theorem, that a very general hypersurface X subset of P-C(3) of degree >= 4 has Pic(X) congruent to Z.

Molecular Mechanics Studies of Homopolymeric and Mixed Sequence Py.Pu*Pu Triple Helices,

DNA triple helices containing two purine strands and one pyrimidine strand (C.G*G and T.A*A) have been studied, using model building followed by energy minimisation, for different orientations of the third strand resulting from variation in the hydrogen bonding between the Watson-Crick duplex and the third strand and the glycosidic torsion angle in the third strand. Our results show that in the C.G*G case the structure with a parallel orientation of the third strand, resulting from Hoogsteen hydrogen bonds between the third strand and the Watson-Crick duplex, is energetically the most favourable while in the T.A*A case the antiparallel orientation of the third strand, resulting from reverse Hoogsteen hydrogen bonds, is energetically the most favourable. These studies when extended to the mixed sequence triplexes, in which the second strand is a mixture of G and A, correspondingly the third strand is a mixture of G and APT, show that though the parallel orientation is still energetically more favourable, the antiparallel orientation becomes energetically comparable with an increasing number of thymines in the third strand. Structurally, for the mixed triplexes containing G and T in the third strand, it is seen that the basepair non-isomorphism between the C.G*G and the T.A*T triplets can be overcome with some changes in the base pair parameters without much distortion of either the backbone or the hydrogen bonds.

Two dimensional weak pseudomanifolds on seven vertices

In this article we have explicitly determined all the 2-dimensional weak pseudomanifolds on 7 vertices. We have proved that there are (up to isomorphism) 13 such weak pseudomanifolds. The geometric carriers of them are 6 topological spaces, three of which are not manifolds.

Strongly minimal triangulations of (S (3) x S (1))(#3) and (S (3) x S (1))(#3)

A triangulated d-manifold K, satisfies the inequality for da parts per thousand yen3. The triangulated d-manifolds that meet the bound with equality are called tight neighbourly. In this paper, we present tight neighbourly triangulations of 4-manifolds on 15 vertices with as an automorphism group. One such example was constructed by Bagchi and Datta (Discrete Math. 311 (citeyearbd102011) 986-995). We show that there are exactly 12 such triangulations up to isomorphism, 10 of which are orientable.