More Like this

1. Observation of the $${{{\Lambda }} _{\text {b}}^{{0}}} \rightarrow {{\text {J}/\uppsi }} {{{\Xi }} ^{{-}}} {{\text {K}} ^{{+}}} $$ decay

   https://doi.org/10.1140/epjc/s10052-024-13114-9  

   Hayrapetyan, A; Tumasyan, A; Adam, W; Andrejkovic, J W; Bergauer, T; Chatterjee, S; Damanakis, K; Dragicevic, M; Valle, A_Escalante Del; Hussain, P S; et al (October 2024, The European Physical Journal C)

   Abstract Using proton–proton collision data corresponding to an integrated luminosity of$$140\hbox { fb}^{-1}$$ $140{\text{fb}}^{-1}$collected by the CMS experiment at$$\sqrt{s}= 13\,\text {Te}\hspace{-.08em}\text {V} $$ $\sqrt{s}=13\text{Te}\text{V}$, the$${{{\Lambda }} _{\text {b}}^{{0}}} \rightarrow {{\text {J}/\uppsi }} {{{\Xi }} ^{{-}}} {{\text {K}} ^{{+}}} $$ ${\Lambda }_{\text{b}}^0\to \text{J}/\psi {\Xi }^{-}{\text{K}}^{+}$decay is observed for the first time, with a statistical significance exceeding 5 standard deviations. The relative branching fraction, with respect to the$${{{\Lambda }} _{\text {b}}^{{0}}} \rightarrow {{{\uppsi }} ({2\textrm{S}})} {{\Lambda }} $$ ${\Lambda }_{\text{b}}^0\to \psi \left(2\text{S}\right)\Lambda$decay, is measured to be$$\mathcal {B}({{{\Lambda }} _{\text {b}}^{{0}}} \rightarrow {{\text {J}/\uppsi }} {{{\Xi }} ^{{-}}} {{\text {K}} ^{{+}}} )/\mathcal {B}({{{\Lambda }} _{\text {b}}^{{0}}} \rightarrow {{{\uppsi }} ({2\textrm{S}})} {{\Lambda }} ) = [3.38\pm 1.02\pm 0.61\pm 0.03]\%$$ $B({\Lambda }_{\text{b}}^0\to \text{J}/\psi {\Xi }^{-}{\text{K}}^{+})/B({\Lambda }_{\text{b}}^0\to \psi \left(2\text{S}\right)\Lambda )=[3.38\pm 1.02\pm 0.61\pm 0.03]\%$, where the first uncertainty is statistical, the second is systematic, and the third is related to the uncertainties in$$\mathcal {B}({{{\uppsi }} ({2\textrm{S}})} \rightarrow {{\text {J}/\uppsi }} {{{\uppi }} ^{{+}}} {{{\uppi }} ^{{-}}} )$$ $B(\psi \left(2\text{S}\right)\to \text{J}/\psi {\pi }^{+}{\pi }^{-})$and$$\mathcal {B}({{{\Xi }} ^{{-}}} \rightarrow {{\Lambda }} {{{\uppi }} ^{{-}}} )$$ $B({\Xi }^{-}\to \Lambda {\pi }^{-})$. 

   more » « less
2. On a Traveling Salesman Problem for Points in the Unit Cube

   https://doi.org/10.1007/s00453-024-01257-w  

   Balogh, József; Clemen, Felix Christian; Dumitrescu, Adrian (September 2024, Algorithmica)

   Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ ${[0,1]}^k$where$$k \ge 2$$ $k\ge 2$. According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ $x_1,x_2,\dots ,x_n$through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}\le c_k$, where$$|x-y|$$ $|x-y|$is the Euclidean distance betweenxandy, and$$c_k$$ $c_k$is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ $x_{n+1}\equiv x_1$. From the other direction, for every$$k \ge 2$$ $k\ge 2$and$$n \ge 2$$ $n\ge 2$, there existnpoints in$$[0,1]^k$$ ${[0,1]}^k$, such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}=2^{1/k}·\sqrt{k}$. For the plane, the best constant is$$c_2=2$$ $c_2=2$and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=9{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$for every$$k \ge 3$$ $k\ge 3$and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ $c_k=2^{1/k}·\sqrt{k}$, for every$$k \ge 2$$ $k\ge 2$. Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=3\sqrt{5}{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ $c_k=2.91\sqrt{k}(1+o_k\left(1\right))$. Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ $c_3\ge 2^{7/6}$, which disproves the conjecture for$$k=3$$ $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 

   more » « less
3. Photo-response of the $$N=Z$$ nucleus $$^{24}$$Mg

   https://doi.org/10.1140/epja/s10050-023-01111-7  

   Deary, J; Scheck, M; Schwengner, R; O’Donnell, D; Bemmerer, D; Beyer, R; Hensel, Th; Junghans, A R; Kögler, T; Müller, S E; et al (September 2023, The European Physical Journal A)

   Abstract The electricE1 and magneticM1 dipole responses of the$$N=Z$$ $N=Z$nucleus$$^{24}$$ ${}^{24}$Mg were investigated in an inelastic photon scattering experiment. The 13.0 MeV electrons, which were used to produce the unpolarised bremsstrahlung in the entrance channel of the$$^{24}$$ ${}^{24}$Mg($$\gamma ,\gamma ^{\prime }$$ $\gamma ,{\gamma }^{\prime }$) reaction, were delivered by the ELBE accelerator of the Helmholtz-Zentrum Dresden-Rossendorf. The collimated bremsstrahlung photons excited one$$J^{\pi }=1^-$$ $J^{\pi }=1^{-}$, four$$J^{\pi }=1^+$$ $J^{\pi }=1^{+}$, and six$$J^{\pi }=2^+$$ $J^{\pi }=2^{+}$states in$$^{24}$$ ${}^{24}$Mg. De-excitation$$\gamma $$ $\gamma$rays were detected using the four high-purity germanium detectors of the$$\gamma $$ $\gamma$ELBE setup, which is dedicated to nuclear resonance fluorescence experiments. In the energy region up to 13.0 MeV a total$$B(M1)\uparrow = 2.7(3)~\mu _N^2$$ $B\left(M1\right)\uparrow =2.7\left(3\right){\mu }_N^2$is observed, but this$$N=Z$$ $N=Z$nucleus exhibits only marginalE1 strength of less than$$\sum B(E1)\uparrow \le 0.61 \times 10^{-3}$$ $\sum B\left(E1\right)\uparrow \le 0.61\times {10}^{-3}$ e$$^2 \, $$ ${}^2$fm$$^2$$ ${}^2$. The$$B(\varPi 1, 1^{\pi }_i \rightarrow 2^+_1)/B(\varPi 1, 1^{\pi }_i \rightarrow 0^+_{gs})$$ $B(\Pi 1,1_i^{\pi }\to 2_1^{+})/B(\Pi 1,1_i^{\pi }\to 0_{\mathrm{gs}}^{+})$branching ratios in combination with the expected results from the Alaga rules demonstrate thatKis a good approximative quantum number for$$^{24}$$ ${}^{24}$Mg. The use of the known$$\rho ^2(E0, 0^+_2 \rightarrow 0^+_{gs})$$ ${\rho }^2(E0,0_2^{+}\to 0_{\mathrm{gs}}^{+})$strength and the measured$$B(M1, 1^+ \rightarrow 0^+_2)/B(M1, 1^+ \rightarrow 0^+_{gs})$$ $B(M1,1^{+}\to 0_2^{+})/B(M1,1^{+}\to 0_{\mathrm{gs}}^{+})$branching ratio of the 10.712 MeV$$1^+$$ $1^{+}$level allows, in a two-state mixing model, an extraction of the difference$$\varDelta \beta _2^2$$ $\Delta {\beta }_2^2$between the prolate ground-state structure and shape-coexisting superdeformed structure built upon the 6432-keV$$0^+_2$$ $0_2^{+}$level. 

   more » « less
4. Algorithms for covering multiple submodular constraints and applications

   https://doi.org/10.1007/s10878-022-00874-x  

   Chekuri, Chandra; Inamdar, Tanmay; Quanrud, Kent; Varadarajan, Kasturi; Zhang, Zhao (June 2022, Journal of Combinatorial Optimization)

   Abstract We consider the problem of covering multiple submodular constraints. Given a finite ground setN, a weight function$$w: N \rightarrow \mathbb {R}_+$$ $w:N\to R_{+}$,rmonotone submodular functions$$f_1,f_2,\ldots ,f_r$$ $f_1,f_2,\dots ,f_r$overNand requirements$$k_1,k_2,\ldots ,k_r$$ $k_1,k_2,\dots ,k_r$the goal is to find a minimum weight subset$$S \subseteq N$$ $S\subseteq N$such that$$f_i(S) \ge k_i$$ $f_i\left(S\right)\ge k_i$for$$1 \le i \le r$$ $1\le i\le r$. We refer to this problem asMulti-Submod-Coverand it was recently considered by Har-Peled and Jones (Few cuts meet many point sets. CoRR.arxiv:abs1808.03260Har-Peled and Jones 2018) who were motivated by an application in geometry. Even with$$r=1$$ $r=1$Multi-Submod-Covergeneralizes the well-known Submodular Set Cover problem (Submod-SC), and it can also be easily reduced toSubmod-SC. A simple greedy algorithm gives an$$O(\log (kr))$$ $O(log(kr\left)\right)$approximation where$$k = \sum _i k_i$$ $k={\sum }_i{k}_i$and this ratio cannot be improved in the general case. In this paper, motivated by several concrete applications, we consider two ways to improve upon the approximation given by the greedy algorithm. First, we give a bicriteria approximation algorithm forMulti-Submod-Coverthat covers each constraint to within a factor of$$(1-1/e-\varepsilon )$$ $(1-1/e-\epsilon )$while incurring an approximation of$$O(\frac{1}{\epsilon }\log r)$$ $O(\frac{1}{ϵ}logr)$in the cost. Second, we consider the special case when each$$f_i$$ $f_i$is a obtained from a truncated coverage function and obtain an algorithm that generalizes previous work on partial set cover (Partial-SC), covering integer programs (CIPs) and multiple vertex cover constraints Bera et al. (Theoret Comput Sci 555:2–8 Bera et al. 2014). Both these algorithms are based on mathematical programming relaxations that avoid the limitations of the greedy algorithm. We demonstrate the implications of our algorithms and related ideas to several applications ranging from geometric covering problems to clustering with outliers. Our work highlights the utility of the high-level model and the lens of submodularity in addressing this class of covering problems. 

   more » « less
5. Spherical convex hull of random points on a wedge

   https://doi.org/10.1007/s00208-023-02704-9  

   Besau, Florian; Gusakova, Anna; Reitzner, Matthias; Schütt, Carsten; Thäle, Christoph; Werner, Elisabeth_M (August 2023, Mathematische Annalen)

   Abstract Consider two half-spaces$$H_1^+$$ $H_1^{+}$and$$H_2^+$$ $H_2^{+}$in$${\mathbb {R}}^{d+1}$$ $R^{d+1}$whose bounding hyperplanes$$H_1$$ $H_1$and$$H_2$$ $H_2$are orthogonal and pass through the origin. The intersection$${\mathbb {S}}_{2,+}^d:={\mathbb {S}}^d\cap H_1^+\cap H_2^+$$ $S_{2,+}^d:=S^d\cap H_1^{+}\cap H_2^{+}$is a spherical convex subset of thed-dimensional unit sphere$${\mathbb {S}}^d$$ $S^d$, which contains a great subsphere of dimension$$d-2$$ $d-2$and is called a spherical wedge. Choosenindependent random points uniformly at random on$${\mathbb {S}}_{2,+}^d$$ $S_{2,+}^d$and consider the expected facet number of the spherical convex hull of these points. It is shown that, up to terms of lower order, this expectation grows like a constant multiple of$$\log n$$ $logn$. A similar behaviour is obtained for the expected facet number of a homogeneous Poisson point process on$${\mathbb {S}}_{2,+}^d$$ $S_{2,+}^d$. The result is compared to the corresponding behaviour of classical Euclidean random polytopes and of spherical random polytopes on a half-sphere. 

   more » « less