DiscKosky: Efficient Genealogical Constraints from Sector-By-Sector Critical Point Counting
Abstract
We present DiscKosky, a new Mathematica package for efficiently generating genealogical constraints on the sequential discontinuities of Feynman integrals. DiscKosky works by tracking the solutions to the critical point equations associated with a Feynman integral; by identifying which of these critical points cease to exist in a given kinematic limit, we can associate each Landau singularity with a set of on-shell sectors. The hierarchical principle then forbids sequential discontinuities with respect to singularities that are associated with incompatible sets of on-shell propagators. In rare cases, this algorithm fails to make predictions due to the appearance of higher-dimensional critical varieties---nevertheless, we show that this phenomenon can sometimes be used to identify non-repeating discontinuities, which can be computed at most once in a Feynman integral. We illustrate the power of DiscKosky by applying the package to a broad class of Feynman integrals, including two-loop five-point integrals with one and two massive legs, and three-loop examples that go beyond the current computational frontier. DiscKosky can also be used to probe the analytic properties of more general classes of Euler integrals, which we illustrate by considering several examples that arise in the context of cosmological correlators.
Related
- QuantumFCS.jl: Efficient Full-Counting Statistics for Open Quantum Systems
- Efficient Estimation of Logical Sensitivities Through Fault-Counting
- Efficient laser ion acceleration in near-critical density plasmas in the picosecond pulse regime
- Statistically calibrated effective projected optical-depth imaging from paired photon-counting returns
- BER analysis and enhanced SIC for photon-counting NOMA in photon-limited OWC
BibTeX
@misc{crisanti2026disckosky,
title = {{DiscKosky: Efficient Genealogical Constraints from Sector-By-Sector Critical Point Counting}},
author = {Giulio Crisanti and Luke Lippstreu and Andrew J. McLeod and Maria Polackova},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40772},
eprint = {2610.40772},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40772},
}
RIS
TY - UNPB
TI - DiscKosky: Efficient Genealogical Constraints from Sector-By-Sector Critical Point Counting
AU - Giulio Crisanti
AU - Luke Lippstreu
AU - Andrew J. McLeod
AU - Maria Polackova
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40772
UR - https://arxiv.org/abs/2610.40772
AB - We present DiscKosky, a new Mathematica package for efficiently generating genealogical constraints on the sequential discontinuities of Feynman integrals. DiscKosky works by tracking the solutions to the critical point equations associated with a Feynman integral; by identifying which of these critical points cease to exist in a given kinematic limit, we can associate each Landau singularity with a set of on-shell sectors. The hierarchical principle then forbids sequential discontinuities with respect to singularities that are associated with incompatible sets of on-shell propagators. In rare cases, this algorithm fails to make predictions due to the appearance of higher-dimensional critical varieties---nevertheless, we show that this phenomenon can sometimes be used to identify non-repeating discontinuities, which can be computed at most once in a Feynman integral. We illustrate the power of DiscKosky by applying the package to a broad class of Feynman integrals, including two-loop five-point integrals with one and two massive legs, and three-loop examples that go beyond the current computational frontier. DiscKosky can also be used to probe the analytic properties of more general classes of Euler integrals, which we illustrate by considering several examples that arise in the context of cosmological correlators.
ER -