Tootfinder

The LHCb Stripping Project: Sustainable Legacy Data Processing for High-Energy Physics
Nathan Grieser, Eduardo Rodrigues, Niladri Sahoo, Shuqi Sheng, Nicole Skidmore, Mark Smith
https://arxiv.org/abs/2509.05294

The LHCb Stripping Project: Sustainable Legacy Data Processing for High-Energy Physics
The LHCb Stripping project is a pivotal component of the experiment's data processing framework, designed to refine vast volumes of collision data into manageable samples for offline analysis. It ensures the re-analysis of Runs 1 and 2 legacy data, maintains the software stack, and executes (re-)Stripping campaigns. As the focus shifts toward newer data sets, the project continues to optimize infrastructure for both legacy and live data processing. This paper provides a comprehensive overview o…

Complexity Analysis of the Regular Simplicial Search Method with Reflection and Shrinking Steps for Derivative-Free Optimization
Liyuan Cao, Wei Hu, Jinxin Wang
https://arxiv.org/abs/2508.16561

Complexity Analysis of the Regular Simplicial Search Method with Reflection and Shrinking Steps for Derivative-Free Optimization
Simplex-type methods, such as the well-known Nelder-Mead algorithm, are widely used in derivative-free optimization (DFO), particularly in practice. Despite their popularity, the theoretical understanding of their convergence properties has been limited, and until very recently essentially no worst-case complexity bounds were available. Recently, Cao et al. provided a sharp error bound for linear interpolation and extrapolation and derived a worst-case complexity result for a basic simplex-type…

Connected components of Berkovich fixed point locus
Niladri Patra
https://arxiv.org/abs/2508.07156 https://arxiv.org/pdf/2508.07156

Connected components of Berkovich fixed point locus
Let $\mathbb{P}^{1}_{an}$ be the Berkovich projective line over a complete, algebraically closed, non-Archimedean field of characteristic $0$. Let $ϕ$ be a degree $\geq 2$ rational map with potential good reduction, acting on $\mathbb{P}^{1}_{an}$. In this article, we give an easily verifiable equivalent criterion for the fixed point locus of $ϕ$ to be connected. We also give an equivalent criterion for the fixed point locus of $ϕ$ to be finite. Moreover, we provide a sharp upper bound for t…