Conformational behavior of different possible ways of oligoglycine formation in a solvent-free environment

The possible ways for glycine oligopeptide formation in gas phase, both in the extended P-strand like conformation and folded 2(7)-ribbon like conformations are analyzed using quantum chemical calculations. We focus on the sequential formation of peptide bond through upgradation of the immediate lower order molecule and observe the consequences in other related processes like oligoglycine formation through simultaneous peptide linkage of n glycine monomers and interchange of molecular conformation through peptide linkage. A comparison is made between the structures and binding energies obtained for both conformers. All binding energies are increased by the zero-point energy contribution. The role of electron correlation effects is briefly analyzed. The folded 2(7)-ribbon-like conformations in vacuo are found to be more stable in comparison to the extended structure. (c) 2007 Elsevier B.V. All rights reserved.

An inductor-free realization of the Chua`s circuit based on electronic analogy

Although literature presents several alternatives, an approach based on the electronic analogy was still not considered for the implementation of an inductor-free realization of the double scroll Chua`s circuit. This paper presents a new inductor-free configuration of the Chua`s circuit based on the electronic analogy. This proposal results in a versatile and functional inductorless implementation of the Chua`s circuit that offers new and interesting features for several applications. The analogous circuit is implemented and used to perform an experimental mapping of a large variety of attractors.

From decoherence-free channels to decoherence-free and quasi-free subspaces within bosonic dissipative networks

We present a technique to build, within a dissipative bosonic network, decoherence-free channels (DFCs): a group of normal-mode oscillators with null effective damping rates. We verify that the states protected within the DFC define the well-known decoherence-free subspaces (DFSs) when mapped back into the natural network oscillators. Therefore, our technique to build protected normal-mode channels turns out to be an alternative way to build DFSs, which offers advantages over the conventional method. It enables the computation of all the network-protected states at once, as well as leading naturally to the concept of the decoherence quasi-free subspace (DQFS), inside which a superposition state is quasi-completely protected against decoherence. The concept of the DQFS, weaker than that of the DFS, may provide a more manageable mechanism to control decoherence. Finally, as an application of the DQFSs, we show how to build them for quasi-perfect state transfer in networks of coupled quantum dissipative oscillators.

Repetition-free longest common subsequence

We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard. (C) 2009 Elsevier B.V. All rights reserved.

Three-dimensional, fully adaptive simulations of phase-field fluid models

We present an efficient numerical methodology for the 31) computation of incompressible multi-phase flows described by conservative phase-field models We focus here on the case of density matched fluids with different viscosity (Model H) The numerical method employs adaptive mesh refinements (AMR) in concert with an efficient semi-implicit time discretization strategy and a linear, multi-level multigrid to relax high order stability constraints and to capture the flow`s disparate scales at optimal cost. Only five linear solvers are needed per time-step. Moreover, all the adaptive methodology is constructed from scratch to allow a systematic investigation of the key aspects of AMR in a conservative, phase-field setting. We validate the method and demonstrate its capabilities and efficacy with important examples of drop deformation, Kelvin-Helmholtz instability, and flow-induced drop coalescence (C) 2010 Elsevier Inc. All rights reserved

A Robust, Fully Adaptive Hybrid Level-Set/Front-Tracking Method for Two-Phase Flows with an Accurate Surface Tension Computation

We present a variable time step, fully adaptive in space, hybrid method for the accurate simulation of incompressible two-phase flows in the presence of surface tension in two dimensions. The method is based on the hybrid level set/front-tracking approach proposed in [H. D. Ceniceros and A. M. Roma, J. Comput. Phys., 205, 391400, 2005]. Geometric, interfacial quantities are computed from front-tracking via the immersed-boundary setting while the signed distance (level set) function, which is evaluated fast and to machine precision, is used as a fluid indicator. The surface tension force is obtained by employing the mixed Eulerian/Lagrangian representation introduced in [S. Shin, S. I. Abdel-Khalik, V. Daru and D. Juric, J. Comput. Phys., 203, 493-516, 2005] whose success for greatly reducing parasitic currents has been demonstrated. The use of our accurate fluid indicator together with effective Lagrangian marker control enhance this parasitic current reduction by several orders of magnitude. To resolve accurately and efficiently sharp gradients and salient flow features we employ dynamic, adaptive mesh refinements. This spatial adaption is used in concert with a dynamic control of the distribution of the Lagrangian nodes along the fluid interface and a variable time step, linearly implicit time integration scheme. We present numerical examples designed to test the capabilities and performance of the proposed approach as well as three applications: the long-time evolution of a fluid interface undergoing Rayleigh-Taylor instability, an example of bubble ascending dynamics, and a drop impacting on a free interface whose dynamics we compare with both existing numerical and experimental data.

A NOTE ON FREE GROUPS IN THE RING OF FRACTIONS OF SKEW POLYNOMIAL RINGS

Let L be a function field over the rationals and let D denote the skew field of fractions of L[t; sigma], the skew polynomial ring in t, over L, with automorphism sigma. We prove that the multiplicative group D(x) of D contains a free noncyclic subgroup.

Nuclear elements of degree 6 in the free alternative algebra

We construct five new elements of degree 6 in the nucleus of the free alternative algebra. We use the representation theory of the symmetric group to locate the elements. We use the computer algebra system ALBERT and an extension of ALBERT to express the elements in compact form and to show that these new elements are not a consequence of the known clegree-5 elements in the nucleus. We prove that these five new elements and four known elements form a basis for the subspace of nuclear elements of degree 6. Our calculations are done using modular arithmetic to save memory and time. The calculations can be done in characteristic zero or any prime greater than 6, and similar results are expected. We generated the nuclear elements using prime 103. We check our answer using five other primes.

Bicyclic units, Bass cyclic units and free groups

Let G be a finite group and ZG its integral group ring. We show that if alpha is a nontrivial bicyclic unit of ZG, then there are bicyclic units beta and gamma of different types, such that and are non-abelian free groups. In the case when G is non-abelian of order coprime to 6 we prove the existence of a bicyclic unit u and a Bass cyclic unit v in ZG, such that < u(m), v > is a free non-abelian group for all sufficiently large positive integers m.

Free groups in central simple algebras without Tits` theorem

Let R be a noncommutative central simple algebra, the center k of which is not absolutely algebraic, and consider units a,b of R such that {a,a(b)} freely generate a free group. It is shown that such b can be chosen from suitable Zariski dense open subsets of R, while the a can be chosen from a set of cardinality \k\ (which need not be open).

INVOLUTIONS AND FREE PAIRS OF BASS CYCLIC UNITS IN INTEGRAL GROUP RINGS

Let ZG be the integral group ring of the finite nonabelian group G over the ring of integers Z, and let * be an involution of ZG that extends one of G. If x and y are elements of G, we investigate when pairs of the form (u(k,m)(x*), u(k,m)(x*)) or (u(k,m)(x), u(k,m)(y)), formed respectively by Bass cyclic and *-symmetric Bass cyclic units, generate a free noncyclic subgroup of the unit group of ZG.

BASS CYCLIC UNITS AS FACTORS IN A FREE GROUP IN INTEGRAL GROUP RING UNITS

Marciniak and Sehgal showed that if u is a non-trivial bicyclic unit of an integral group ring then there is a bicyclic unit v such that u and v generate a non-abelian free group. A similar result does not hold for Bass cyclic units of infinite order based on non-central elements as some of them have finite order modulo the center. We prove a theorem that suggests that this is the only limitation to obtain a non-abelian free group from a given Bass cyclic unit. More precisely, we prove that if u is a Bass cyclic unit of an integral group ring ZG of a solvable and finite group G, such that u has infinite order modulo the center of U(ZG) and it is based on an element of prime order, then there is a non-abelian free group generated by a power of u and a power of a unit in ZG which is either a Bass cyclic unit or a bicyclic unit.

ALTERNATING UNITS AS FREE FACTORS IN THE GROUP OF UNITS OF INTEGRAL GROUP RINGS

Let G be a group of odd order that contains a non-central element x whose order is either a prime p >= 5 or 3(l), with l >= 2. Then, in U(ZG), the group of units of ZG, we can find an alternating unit u based on x, and another unit v, which can be either a bicyclic or an alternating unit, such that for all sufficiently large integers m we have that < u(m), v(m)> = < u(m)> * < v(m)> congruent to Z * Z.

A group topology on the free abelian group of cardinality c that makes its square countably compact

Under p = c, we prove that it is possible to endow the free abelian group of cardinality c with a group topology that makes its square countably compact. This answers a question posed by Madariaga-Garcia and Tomita and by Tkachenko. We also prove that there exists a Wallace semigroup (i.e., a countably compact both-sided cancellative topological semigroup which is not a topological group) whose square is countably compact. This answers a question posed by Grant.

Involutions and free pairs of bicyclic units in integral group rings

If * : G -> G is an involution on the finite group G, then * extends to an involution on the integral group ring Z[G] . In this paper, we consider whether bicyclic units u is an element of Z[G] exist with the property that the group < u, u*> generated by u and u* is free on the two generators. If this occurs, we say that (u, u*)is a free bicyclic pair. It turns out that the existence of u depends strongly upon the structure of G and on the nature of the involution. One positive result here is that if G is a nonabelian group with all Sylow subgroups abelian, then for any involution *, Z[G] contains a free bicyclic pair.