Power counting energy flow polynomials

被引:0
|
作者
Pedro Cal
Jesse Thaler
Wouter J. Waalewijn
机构
[1] Deutsches Elektronen-Synchrotron DESY,Institute for Theoretical Physics Amsterdam and Delta Institute for Theoretical Physics
[2] University of Amsterdam,Center for Theoretical Physics
[3] Nikhef,undefined
[4] Theory Group,undefined
[5] Massachusetts Institute of Technology,undefined
[6] The NSF AI Institute for Artificial Intelligence and Fundamental Interactions,undefined
关键词
Effective Field Theories of QCD; Jets and Jet Substructure; Resummation;
D O I
暂无
中图分类号
学科分类号
摘要
Power counting is a systematic strategy for organizing collider observables and their associated theoretical calculations. In this paper, we use power counting to characterize a class of jet substructure observables called energy flow polynomials (EFPs). EFPs provide an overcomplete linear basis for infrared-and-collinear safe jet observables, but it is known that in practice, a small subset of EFPs is often sufficient for specific jet analysis tasks. By applying power counting arguments, we obtain linear relationships between EFPs that hold for quark and gluon jets to a specific order in the power counting. We test these relations in the parton shower generator Pythia, finding excellent agreement. Power counting allows us to truncate the basis of EFPs without affecting performance, which we corroborate through a study of quark-gluon tagging and regression.
引用
收藏
相关论文
共 50 条
  • [1] Power counting energy flow polynomials
    Cal, Pedro
    Thaler, Jesse
    Waalewijn, Wouter J.
    JOURNAL OF HIGH ENERGY PHYSICS, 2022, 2022 (09)
  • [2] On some counting polynomials and energy properties of superphenalene and supertriphenylene
    Arulperumjothi, M.
    Subramanian, Visalakshi
    Prabhu, S.
    Imran, Muhammad
    SCIENTIFIC REPORTS, 2025, 15 (01):
  • [3] On Modular Counting with Polynomials
    Hansen, Kristoffer Arnsfelt
    CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 202 - 209
  • [4] Counting perfect polynomials
    Cengiz, U. Caner
    Pollack, Paul
    Trevino, Enrique
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 47 : 242 - 255
  • [5] Fullerenes via their counting polynomials
    Ghorbani, Modjtaba
    Alidehi-Ravandi, Razie
    Dehmer, Matthias
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 466
  • [6] Tree Modules and Counting Polynomials
    Kinser, Ryan
    ALGEBRAS AND REPRESENTATION THEORY, 2013, 16 (05) : 1333 - 1347
  • [7] Counting decomposable multivariate polynomials
    von zur Gathen, Joachim
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2011, 22 (03) : 165 - 185
  • [8] Tree Modules and Counting Polynomials
    Ryan Kinser
    Algebras and Representation Theory, 2013, 16 : 1333 - 1347
  • [9] On the Structure of Certain Counting Polynomials
    Valenza, Robert J.
    NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, 2005, 11 (04) : 1 - 11
  • [10] Counting and Testing Dominant Polynomials
    Dubickas, Arturas
    Sha, Min
    EXPERIMENTAL MATHEMATICS, 2015, 24 (03) : 312 - 325