Billiards in a General Domain with Random Reflections

We study stochastic billiards on general tables: a particle moves according to its constant velocity inside some domain D R(d) until it hits the boundary and bounces randomly inside, according to some reflection law. We assume that the boundary of the domain is locally Lipschitz and almost everywhere continuously differentiable. The angle of the outgoing velocity with the inner normal vector has a specified, absolutely continuous density. We construct the discrete time and the continuous time processes recording the sequence of hitting points on the boundary and the pair location/velocity. We mainly focus on the case of bounded domains. Then, we prove exponential ergodicity of these two Markov processes, we study their invariant distribution and their normal (Gaussian) fluctuations. Of particular interest is the case of the cosine reflection law: the stationary distributions for the two processes are uniform in this case, the discrete time chain is reversible though the continuous time process is quasi-reversible. Also in this case, we give a natural construction of a chord ""picked at random"" in D, and we study the angle of intersection of the process with a (d - 1) -dimensional manifold contained in D.

Multiple Brake Orbits and Homoclinics in Riemannian Manifolds

Let (M, g) be a complete Riemannian manifold, Omega subset of Man open subset whose closure is homeomorphic to an annulus. We prove that if a,Omega is smooth and it satisfies a strong concavity assumption, then there are at least two distinct geodesics in starting orthogonally to one connected component of a,Omega and arriving orthogonally onto the other one. Using the results given in Giamb et al. (Adv Differ Equ 10:931-960, 2005), we then obtain a proof of the existence of two distinct homoclinic orbits for an autonomous Lagrangian system emanating from a nondegenerate maximum point of the potential energy, and a proof of the existence of two distinct brake orbits for a class of Hamiltonian systems. Under a further symmetry assumption, the result is improved by showing the existence of at least dim(M) pairs of geometrically distinct geodesics as above, brake orbits and homoclinic orbits. In our proof we shall use recent deformation results proved in Giamb et al. (Nonlinear Anal Ser A: Theory Methods Appl 73:290-337, 2010).

Phase portraits of quadratic polynomial vector fields having a rational first integral of degree 3

In this paper, we classify all the global phase portraits of the quadratic polynomial vector fields having a rational first integral of degree 3. (C) 2008 Elsevier Ltd. All rights reserved.

Path integral representations in noncommutative quantum mechanics and noncommutative version of Berezin-Marinov action

It is known that the actions of field theories on a noncommutative space-time can be written as some modified (we call them theta-modified) classical actions already on the commutative space-time (introducing a star product). Then the quantization of such modified actions reproduces both space-time noncommutativity and the usual quantum mechanical features of the corresponding field theory. In the present article, we discuss the problem of constructing theta-modified actions for relativistic QM. We construct such actions for relativistic spinless and spinning particles. The key idea is to extract theta-modified actions of the relativistic particles from path-integral representations of the corresponding noncommutative field theory propagators. We consider the Klein-Gordon and Dirac equations for the causal propagators in such theories. Then we construct for the propagators path-integral representations. Effective actions in such representations we treat as theta-modified actions of the relativistic particles. To confirm the interpretation, we canonically quantize these actions. Thus, we obtain the Klein-Gordon and Dirac equations in the noncommutative field theories. The theta-modified action of the relativistic spinning particle is just a generalization of the Berezin-Marinov pseudoclassical action for the noncommutative case.

From Rational Design of Drug Crystals to Understanding of Nucleic Acid Structures: Lamivudine Duplex

A DNA-like duplex of nucleosides is probable to exist even without the 5`-phosphate groups needed to assemble the chain backbone. However, double-stranded helical structures of nucleosides are unknown. Here, we report a duplex of nucleoside analogs that is spontaneously assembled due to stacking of the neutral and protonated molecules of lamivudine, a nucleoside reverse transcriptase inhibitor (NTRI) widely used in anti-HIV drug combinatory medication. The left-handed lamivudine duplex has features similar to those of i-motif DNA, as the face-to-face base stacking and the helix rise per base pair. Furthermore, the protonation pattern on alternate bases expected for it DNA-like duplex stabilized by pairing of neutral and protonated cytosine fragments was observed for the first time in the lamivudine double-stranded helix. This structure demonstrates that hydrogen bonds can substitute for covalent phosphodiester linkage in the stabilization of the duplex backbone. This interesting example of spontaneous molecular self-organization indicates that the 5`-phosphate group could not be a requirement for duplex assembly.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.