+Jet Production with the Cambridge/Aachen Algorithm
This paper presents four-loop fixed-order perturbative calculations for the invariant-mass distribution of the highest- jet in +jet production using the Cambridge/Aachen algorithm, demonstrating that this method effectively suppresses large non-global logarithms at fixed order while performing comparably to the algorithm at all orders.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine the universe as a giant, chaotic dance floor where subatomic particles are the dancers. When two protons smash together at nearly the speed of light, they create a shower of new particles, much like a confetti cannon exploding in a crowded room. Physicists call these sprays of particles "jets." To understand the rules of this dance, scientists use a set of mathematical tools called Quantum Chromodynamics (QCD). However, the dance floor is messy. Sometimes, particles that are far apart on the floor start whispering to each other, creating "non-global" effects that are incredibly hard to predict. It's like trying to calculate the noise level in a stadium when the fans in the cheap seats start a chant that ripples all the way to the VIP box. These whispers, known as "non-global logarithms," can throw off the most precise measurements, making it difficult to spot new physics or confirm the Standard Model. To make sense of this chaos, scientists use "jet algorithms," which are like different ways of grouping the confetti into neat piles to measure them. The big question is: which grouping method gives the cleanest, most accurate picture of the explosion?
This paper dives deep into that question by testing a specific grouping method called the Cambridge/Aachen (C/A) algorithm against its rivals, the anti-kt and kt algorithms. The authors, led by K. Khelifa-Kerfa, performed incredibly complex mathematical calculations—going as far as four "loops" (a measure of complexity in particle physics calculations)—to see how the C/A algorithm handles those tricky "whispers" between distant particles. They focused on a scenario where a heavy particle (like a Higgs boson or a Z boson) is produced alongside a jet. Think of the heavy particle as a VIP guest and the jet as their entourage; the goal is to measure the entourage's size without the VIP's presence messing up the count.
The researchers found that the C/A algorithm is a superstar at keeping the noise down, but the story is nuanced. At the two-loop level, C/A and kt performed identically. As the calculations got more complex (three and four loops), C/A generally reduced the size of these unwanted effects by roughly 75% to 80% compared to the other methods for most collision types. However, the "best" algorithm depends heavily on the specific details of the event. The paper explicitly notes that there are specific ranges of the jet radius where the C/A coefficients actually exceed those of kt, and for one specific type of collision involving only gluons (channel 3), the kt algorithm is actually preferred over C/A at the four-loop level to suppress these logarithms. It's as if the C/A algorithm is a super-organized bouncer who usually knows exactly how to group the confetti so that the distant whispers don't distort the measurement, but occasionally, for specific crowd configurations, the kt method works better.
However, the story isn't a simple "C/A wins everything." When the authors tried to predict what happens if you add up all the possible loops (an "all-orders" estimate), the results showed that C/A and kt perform almost equally well in the real world, and both are vastly superior to anti-kt. The paper also notes that while C/A is theoretically cleaner at the fixed-order level for many cases, there is currently no computer code capable of simulating the full, all-orders behavior of C/A for this specific type of measurement, so the authors had to rely on comparing their math to simulations of the other algorithms. They also confirmed that the "finite-Nc corrections" (a fancy way of saying "small tweaks to the math that account for the specific number of colors in our universe") remain tiny, around the percent level, which is good news for the reliability of these calculations.
In short, the paper suggests that if you want to measure the mass of a jet with high precision, the Cambridge/Aachen algorithm is a fantastic choice because it naturally minimizes the confusing, long-distance chatter between particles for most scenarios. While it doesn't completely eliminate the problem and isn't universally superior to kt at every single loop order or collision type, it tames the noise better than the alternatives for a wide range of conditions, offering a clearer view of the particle physics dance floor. The authors conclude that while their four-loop calculations are a major step forward, the full picture of how these algorithms behave at every possible level of complexity still requires more work, particularly in developing better computer simulations to match their advanced math.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.