We calculate the average number of sub-jets in a jet, deened using a recently proposed jet clustering algorithm for hadron-hadron collisions. Our result is exact to leading order in S ; and resums large leading and next-to-leading logarithms of the resolution variable, y cut ; to all orders in S .

J. G. Webb, T. C. Ralph, and E. H. Huntington Centre for Quantum Computer Technology, School of Information Technology and Electrical Engineering, University College, The University of New South Wales, Canberra, Australian Capital Territory 2600, Australia Centre for Quantum Computer Technology, Department of Physics, The University of Queensland, St Lucia, Queensland 4072, Australia Received 1...

The probable behavior of am iuslance of size 1). of the stable marriage problem, chosen uniformly at rmdonl, is studied. Tl~e expected number of stable matchings is shown to be asymptotic t20 e-l77 In 1) for n m. The total rank of wonieu by nleu in the male optimal (pessimnl) matching is proven to be close to II In 11 (resp. T?.‘/ In j?), with high probability. 1980 Mat1~ema.tic.s Subject Class...

The sample-path method is one of the most important tools in simulation-based optimization. The basic idea of the method is to approximate the expected simulation output by the average of sample observations with a common random number sequence. In this paper, we describe a new variant of Powell’s UOBYQA (Unconstrained Optimization BY Quadratic Approximation) method, which integrates a Bayesian...

In this paper we study the sum , where denotes number of divisors n and { p } is a sequence integers indexed by primes. Under certain assumptions show that aforementioned . As an application, consider case given Fourier coefficients modular form.