absorb.md

Ben Bloom

Chronological feed of everything captured from Ben Bloom.

Generalized Day Convolution in ∞-Categorical Algebra

This paper extends the construction of Day convolution to a broader range of structures within ∞-categorical algebra. It provides a necessary and sufficient criterion for exponentiable objects in diverse structures like (equivariant) ∞-operads and virtual double ∞-categories. The work leverages the framework of algebraic patterns (Chu-Haugseng) and introduces a new description of weak Segal fibrations using generalized Segal spaces.

Distributed Secret-Sharing for Scalable Privacy-Preserving Monitoring

Traditional runtime verification with privacy is hampered by computationally expensive cryptographic primitives. This work proposes a distributed monitoring architecture utilizing efficient secret-sharing schemes. This approach significantly reduces overhead, enabling practical real-time privacy-preserving monitoring.

Cell Cycle G1 Arrest and Spatial Dynamics Influence Wound Closure

This paper presents a data-driven approach using the Discrete Laplacian Cell Mechanics (DLCM) framework to model fibroblast-driven wound closure. By integrating in vitro time-lapse microscopy data, the model demonstrates proficient replication of experimental trends. The core insight is that G1 phase arrest and initial spatial arrangement of cell cycle states significantly impact wound healing, providing a quantitative link between single-cell dynamics and emergent tissue behavior.

AI Integration for Future Experimental Particle Physics

This paper outlines a strategic vision for integrating Artificial Intelligence (AI) into experimental particle physics. It identifies key challenges and proposes a roadmap for current and future facilities, such as HL-LHC, DUNE, EIC, FCC-ee, and IceCube-Gen2, to leverage AI for accelerating discovery. The authors advocate for a national-scale collaboration between DOE laboratories and universities to realize an "AI-native" research ecosystem.

Inverse Littlewood Conjecture and Set Structure

This paper investigates the structural properties of finite integer sets $A$ when the $L_1$ norm of the Fourier transform of its characteristic function, $||\widehat{1_A}||_1$, is bounded by $K\log N$. It demonstrates that such sets must contain a large subset with small sumset, and consequently, an arithmetic progression of significant length. The work also refines the constant in the original Littlewood conjecture.