The anti-kt jet clustering algorithm

The k(t) and Cambridge/Aachen inclusive jet finding algorithms for hadronhadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance measure. We examine some properties of a new member of this class, for which the power is negative. This anti-k(t) algorithm essentially behaves like an idealised cone algorithm, in that jets with only soft fragmentation are conical, active and passive areas are equal, the area anomalous dimensions are zero, the non-global logarithms are those of a rigid boundary and the Milan factor is universal. None of these properties hold for existing sequential recombination algorithms, nor for cone algorithms with split-merge steps, such as SISCone. They are however the identifying characteristics of the collinear unsafe plain iterative cone algorithm, for which the anti-k(t) algorithm provides a natural, fast, infrared and collinear safe replacement.