Radiation reaction and quantum damped harmonic oscillator

By taking a Klein-Gordon field as the environment of an harmonic oscillator and using a new method for dealing with quantum dissipative systems (minimal coupling method), the quantum dynamics and radiation reaction for a quantum damped harmonic oscillator investigated. Applying perturbation method, some transition probabilities indicating the way energy flows between oscillator, reservoir and quantum vacuum, obtainedComment: 12 pages. Accepted for publication in Mod. Phys. Lett.

The aspherical Cavicchioli-Hegenbarth-Repovš generalized Fibonacci groups

The Cavicchioli–Hegenbarth–Repovš generalized Fibonacci groups are defined by the presentations Gn (m, k) = 〈x 1, … , xn | xixi+m = xi+k (1 ⩽ i ⩽ n)〉. These cyclically presented groups generalize Conway's Fibonacci groups and the Sieradski groups. Building on a theorem of Bardakov and Vesnin we classify the aspherical presentations Gn (m, k). We determine when Gn (m, k) has infinite abelianization and provide sufficient conditions for Gn (m, k) to be perfect. We conjecture that these are also necessary conditions. Combined with our asphericity theorem, a proof of this conjecture would imply a classification of the finite Cavicchioli–Hegenbarth–Repovš groups

INVESTIGATION OF THE HOMOGENIZATION EFFICIENCY OF THE SCREW AGITATOR, HELICAL RIBBON AGITATOR, GATE TYPE ANCHOR IMPELLER AND THE MULTI-PADDLE AGITATOR IN THE MIXING OF HIGH-VISCOSITY NEWTONIAN LIQUIDS

Presented by Prof. Dr. P. FOLDE

Looking for a time independent Hamiltonian of a dynamical system

In this paper we introduce a method for finding a time independent Hamiltonian of a given dynamical system by canonoid transformation. We also find a condition that the system should satisfy to have an equivalent time independent formulation. We study the example of damped oscillator and give the new time independent Hamiltonian for it, which has the property of tending to the standard Hamiltonian of the harmonic oscillator as damping goes to zero.Comment: Some references added, LATEX fixing

All simple groups with order from 1 million to 5 million are efficient

There is much interest in finding short presentations for the finite simple groups. Indeed it has been suggested that all these groups are efficient in a technical sense. In previous papers we produced nice efficient presentations for all except one of the simple groups with order less than one million. Here we show that all simple groups with order between 1 million and 5 million are efficient by giving efficient presentations for all of them. Apart from some linear groups these results are all new. We also show that some covering groups and some larger simple groups are efficient We make substantial use of systems for computational group theory and, in particular, of computer implementations of coset enumeration to find and verify our presentations