More Like this

1. Uniqueness of some Calabi–Yau metrics on $${\mathbf {C}}^{{n}}$$

   https://doi.org/10.1007/s00039-020-00543-3  

   Székelyhidi, Gábor (August 2020, Geometric and Functional Analysis)
2. $$\mathbf{C^{2}}$$-Lusin approximation of strongly convex functions

   https://doi.org/10.1007/s00222-024-01252-6  

   Azagra, Daniel; Drake, Marjorie; Hajłasz, Piotr (June 2024, Inventiones mathematicae)
3. Resolution Analysis of Inverting the Generalized N-Dimensional Radon Transform in $$\pmb {\mathbf {\mathbb {R}}^n}$$ from Discrete Data

   https://doi.org/10.1007/s00041-022-09975-x  

   Katsevich, Alexander (February 2023, Journal of Fourier Analysis and Applications)
4. Direct measurement of the muonic content of extensive air showers between $$\mathbf { 2\times 10^{17}}$$ and $$\mathbf {2\times 10^{18}}~$$eV at the Pierre Auger Observatory

   https://doi.org/10.1140/epjc/s10052-020-8055-y  

   Aab, A.; Abreu, P.; Aglietta, M.; Albury, J. M.; Allekotte, I.; Almela, A.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Anastasi, G. A.; Anchordoqui, L.; et al (August 2020, The European Physical Journal C)

   null (Ed.)

   Abstract The hybrid design of the Pierre Auger Observatory allows for the measurement of the properties of extensive air showers initiated by ultra-high energy cosmic rays with unprecedented precision. By using an array of prototype underground muon detectors, we have performed the first direct measurement, by the Auger Collaboration, of the muon content of air showers between $$2\times 10^{17}$$ 2 × 10 17 and $$2\times 10^{18}$$ 2 × 10 18 eV. We have studied the energy evolution of the attenuation-corrected muon density, and compared it to predictions from air shower simulations. The observed densities are found to be larger than those predicted by models. We quantify this discrepancy by combining the measurements from the muon detector with those from the Auger fluorescence detector at $$10^{{17.5}}\, {\mathrm{eV}} $$ 10 17.5 eV and $$10^{{18}}\, {\mathrm{eV}} $$ 10 18 eV . We find that, for the models to explain the data, an increase in the muon density of $$38\%$$ 38 % $$\pm 4\% (12\%)$$ ± 4 % ( 12 % ) $$\pm {}^{21\%}_{18\%}$$ ± 18 % 21 % for EPOS-LHC , and of $$50\% (53\%)$$ 50 % ( 53 % ) $$\pm 4\% (13\%)$$ ± 4 % ( 13 % ) $$\pm {}^{23\%}_{20\%}$$ ± 20 % 23 % for QGSJetII-04 , is respectively needed. 

   more » « less
5. Subset Sum in Time 2^{n/2}/poly(n)

   https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.39  

   Chen, Xi; Jin, Yaonan; Randolph, Tim; Servedio, Rocco A. (January 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023))

   Megow, Nicole; Smith, Adam (Ed.)

   A major goal in the area of exact exponential algorithms is to give an algorithm for the (worst-case) n-input Subset Sum problem that runs in time 2^{(1/2 - c)n} for some constant c > 0. In this paper we give a Subset Sum algorithm with worst-case running time O(2^{n/2} ⋅ n^{-γ}) for a constant γ > 0.5023 in standard word RAM or circuit RAM models. To the best of our knowledge, this is the first improvement on the classical "meet-in-the-middle" algorithm for worst-case Subset Sum, due to Horowitz and Sahni, which can be implemented in time O(2^{n/2}) in these memory models [Horowitz and Sahni, 1974]. Our algorithm combines a number of different techniques, including the "representation method" introduced by Howgrave-Graham and Joux [Howgrave-Graham and Joux, 2010] and subsequent adaptations of the method in Austrin, Kaski, Koivisto, and Nederlof [Austrin et al., 2016], and Nederlof and Węgrzycki [Jesper Nederlof and Karol Wegrzycki, 2021], and "bit-packing" techniques used in the work of Baran, Demaine, and Pǎtraşcu [Baran et al., 2005] on subquadratic algorithms for 3SUM. 

   more » « less