Gluon jets from quarkonia

A detailed analysis is made within perturbative QCD of the decays into gluon jets of P-wave and S-wave quarkonia (J^PC = 0⁺⁺, 1⁺⁺, 2⁺⁺, 1^+? and 0^?+, 1^??). For all those states we compute to leading non-trivial order in α_s the conventional fraction f(?, δ) of the jet-like hadronic final states, characterized by the back-to-back cone of half angle δ, in which all but a small fraction ? of the total energy is emitted. To the same order we give also the average values of thrust momenta and spherocity distributions.     

The Lefschetz number of an involution on the space of harmonic cusp forms ofSL 3

Inventiones mathematicae -     

Christoffel-Darboux-type formulae and a recurrence for biorthogonal polynomials

It is proved that biorthogonal polynomials obey two different kinds of Christoffel-Darboux-type formulae, one linking polynomials with a different parameter and one combining polynomials with different degrees. This is used to produce a mixed recurrence relation, which is valid for all biorthogonal polynomials. This recurrence relation establishes several results on interlacing property of zeros of successive biorthogonal polynomials and leads to a new result on the interlace of zeros of orthogonal polynomials (of equal degrees) with respect to two distributionsdψ(x) andx ^p dψ(x), 0<p≤1, with support in either [0, 1] or [1, ∞).     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

The diffraction of plane gravitational waves by the edge of an ice cover

The diffraction of plane surface gravitational waves by the edge of an ice cover lying on the surface of an incompressible fluid of infinitely great depth is considered. The ice cover is simulated by a thin elastic plate. The wave reflection and transmission coefficients are determined when it interacts with the ice cover. A wave field is constructed in the fluid under the conditions that a periodic lumped force and a lumped moment act on the edge of the ice cover. It is shown that as the incident wavelength increases the reflection coefficient tends to zero and the transmission coefficient tends to unity.     

Effects of sputter deposition parameters and post-deposition annealing on the electrical characteristics of LaAlO3 dielectric films on Si

The influence of processing parameters on the electrical characteristics of RuO₂/LaAlO₃/Si metal-oxide-semiconductor structures was investigated. In particular, the sputtering regime during deposition of LaAlO₃ on Si and the atmosphere used in the post-deposition annealing step were addressed by determining capacitance-voltage and gate current-voltage characteristics. These results were correlated with compositional information obtained by Rutherford backscattering spectrometry and nuclear reaction analysis. A post-deposition annealing step in oxygen at 600 °C resulted in better electrical characteristics of the final structure as compared to the same treatment performed in nitrogen. This result is explained by oxygen ability to heal oxygen vacancies in the LaAlO₃ film, especially at the dielectric/semiconductor interface region. A thermalized sputtering regime during deposition of LaAlO₃ on Si leads to capacitors with electrical characteristics superior to those deposited in ballistic regime. PACS 77.84.Dy; 81.15.Cd; 81.40.Gh; 73.40.Qv; 82.80.Yc     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.