Can perturbative QCD predict a substantial part of diffractive LHC/SSC physics?

We examine a model of hadronic diffractive scattering which interpolates between perturbative QCD and non-perturbative fits. We restrict the perturbative QCD resummation to the large transverse momentum region, and use a simple Regge-pole parametrization in the infrared region. This picture allows us to account for existing data, and to estimate the size of the perturbative contribution to future diffractive measurements. At LHC and SSC energies, we find that a cut-off BFKL equation can lead to a measurable perturbative component in traditionally soft processes. In particular, we show that the total pp cross section could become as large as 228 mb (160 mb) and the rho parameter as large as 0.23 (0.24) at the SSC (LHC).Comment: 9 pages, McGill/92-3

Competitive Algorithms for Layered Graph Traversal

A layered graph is a connected graph whose vertices are partitioned into sets L0=s, L1, L2,..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is {|Li|}. In the on-line layered graph traversal problem, a searcher starts at s in a layered graph of unknown width and tries to reach a target vertex t; however, the vertices in layer i and the edges between layers i-1 and i are only revealed when the searcher reaches layer i-1. We give upper and lower bounds on the competitive ratio of layered graph traversal algorithms. We give a deterministic on-line algorithm which is O(9w)-competitive on width-w graphs and prove that for no w can a deterministic on-line algorithm have a competitive ratio better than 2w-2 on width-w graphs. We prove that for all w, w/2 is a lower bound on the competitive ratio of any randomized on-line layered graph traversal algorithm. For traversing layered graphs consisting of w disjoint paths tied together at a common source, we give a randomized on-line algorithm with a competitive ratio of O(log w) and prove that this is optimal up to a constant factor