Selective amplification of scars in a chaotic optical fiber

In this letter we propose an original mechanism to select scar modes through coherent gain amplification in a multimode D-shaped fiber. More precisely, we numerically demonstrate how scar modes can be amplified by positioning a gain region in the vicinity of specific points of a short periodic orbit known to give rise to scar modes

Classical and quantum decay of one dimensional finite wells with oscillating walls

To study the time decay laws (tdl) of quasibounded hamiltonian systems we have considered two finite potential wells with oscillating walls filled by non interacting particles. We show that the tdl can be qualitatively different for different movement of the oscillating wall at classical level according to the characteristic of trapped periodic orbits. However, the quantum dynamics do not show such differences.Comment: RevTeX, 15 pages, 14 PostScript figures, submitted to Phys. Rev.

MICROTUBULE PROTEIN : Identification in and Transport to Nerve Endings

The subunit protein of microtubules, tubulin, has been demonstrated to be present in isolated nerve endings by gel electrophoresis, amino acid composition, and peptide mapping. The tubulin constitutes approximately 28% of the soluble protein of the nerve endings. The transport of tubulin to the nerve endings has been demonstrated and its relationship to slow transport is discussed

New, Highly Accurate Propagator for the Linear and Nonlinear Schr\"odinger Equation

A propagation method for the time dependent Schr\"odinger equation was studied leading to a general scheme of solving ode type equations. Standard space discretization of time-dependent pde's usually results in system of ode's of the form u_t -Gu = s where G is a operator (matrix) and u is a time-dependent solution vector. Highly accurate methods, based on polynomial approximation of a modified exponential evolution operator, had been developed already for this type of problems where G is a linear, time independent matrix and s is a constant vector. In this paper we will describe a new algorithm for the more general case where s is a time-dependent r.h.s vector. An iterative version of the new algorithm can be applied to the general case where G depends on t or u. Numerical results for Schr\"odinger equation with time-dependent potential and to non-linear Schr\"odinger equation will be presented.Comment: 14 page

Time-dependent unitary perturbation theory for intense laser driven molecular orientation

We apply a time-dependent perturbation theory based on unitary transformations combined with averaging techniques, on molecular orientation dynamics by ultrashort pulses. We test the validity and the accuracy of this approach on LiCl described within a rigid-rotor model and find that it is more accurate than other approximations. Furthermore, it is shown that a noticeable orientation can be achieved for experimentally standard short laser pulses of zero time average. In this case, we determine the dynamically relevant parameters by using the perturbative propagator, that is derived from this scheme, and we investigate the temperature effects on the molecular orientation dynamics.Comment: 16 pages, 6 figure

Decoherence and the rate of entropy production in chaotic quantum systems

We show that for an open quantum system which is classically chaotic (a quartic double well with harmonic driving coupled to a sea of harmonic oscillators) the rate of entropy production has, as a function of time, two relevant regimes: For short times it is proportional to the diffusion coefficient (fixed by the system--environment coupling strength). For longer times (but before equilibration) there is a regime where the entropy production rate is fixed by the Lyapunov exponent. The nature of the transition time between both regimes is investigated.Comment: Revtex, 4 pages, 3 figures include

Fast Algorithm for Finding the Eigenvalue Distribution of Very Large Matrices

A theoretical analysis is given of the equation of motion method, due to Alben et al., to compute the eigenvalue distribution (density of states) of very large matrices. The salient feature of this method is that for matrices of the kind encountered in quantum physics the memory and CPU requirements of this method scale linearly with the dimension of the matrix. We derive a rigorous estimate of the statistical error, supporting earlier observations that the computational efficiency of this approach increases with matrix size. We use this method and an imaginary-time version of it to compute the energy and the specific heat of three different, exactly solvable, spin-1/2 models and compare with the exact results to study the dependence of the statistical errors on sample and matrix size.Comment: 24 pages, 24 figure

Multi-filament structures in relativistic self-focusing

A simple model is derived to prove the multi-filament structure of relativistic self-focusing with ultra-intense lasers. Exact analytical solutions describing the transverse structure of waveguide channels with electron cavitation, for which both the relativistic and ponderomotive nonlinearities are taken into account, are presented.Comment: 21 pages, 12 figures, submitted to Physical Review

Characterizing Triviality of the Exponent Lattice of A Polynomial through Galois and Galois-Like Groups

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all irreducible polynomials with integer coefficients have only trivial exponent lattices. However, the algorithms in the literature have difficulty in proving such triviality for a generic polynomial. In this paper, the relations between the Galois group (respectively, \emph{the Galois-like groups}) and the triviality of the exponent lattice of a polynomial are investigated. The \bbbq\emph{-trivial} pairs, which are at the heart of the relations between the Galois group and the triviality of the exponent lattice of a polynomial, are characterized. An effective algorithm is developed to recognize these pairs. Based on this, a new algorithm is designed to prove the triviality of the exponent lattice of a generic irreducible polynomial, which considerably improves a state-of-the-art algorithm of the same type when the polynomial degree becomes larger. In addition, the concept of the Galois-like groups of a polynomial is introduced. Some properties of the Galois-like groups are proved and, more importantly, a sufficient and necessary condition is given for a polynomial (which is not necessarily irreducible) to have trivial exponent lattice.Comment: 19 pages,2 figure

Extended Gaussian wave packet dynamics

We examine an extension to the theory of Gaussian wave packet dynamics in a one-dimensional potential by means of a sequence of time dependent displacement and squeezing transformations. Exact expressions for the quantum dynamics are found, and relationships are explored between the squeezed system, Gaussian wave packet dynamics, the time dependent harmonic oscillator, and wave packet dynamics in a Gauss-Hermite basis. Expressions are given for the matrix elements of the potential in some simple cases. Several examples are given, including the propagation of a non-Gaussian initial state in a Morse potential