More Like this

1. Construction of a Dirichlet form on Metric Measure Spaces of Controlled Geometry

   https://doi.org/10.1007/s11118-024-10144-6  

   Butaev, Almaz; Luo, Liangbing; Shanmugalingam, Nageswari (June 2024, Potential Analysis)

   Abstract Given a compact doubling metric measure spaceXthat supports a 2-Poincaré inequality, we construct a Dirichlet form on$$N^{1,2}(X)$$ $N^{1,2}\left(X\right)$that is comparable to the upper gradient energy form on$$N^{1,2}(X)$$ $N^{1,2}\left(X\right)$. Our approach is based on the approximation ofXby a family of graphs that is doubling and supports a 2-Poincaré inequality (see [20]). We construct a bilinear form on$$N^{1,2}(X)$$ $N^{1,2}\left(X\right)$using the Dirichlet form on the graph. We show that the$$\Gamma $$ $\Gamma$-limit$$\mathcal {E}$$ $E$of this family of bilinear forms (by taking a subsequence) exists and that$$\mathcal {E}$$ $E$is a Dirichlet form onX. Properties of$$\mathcal {E}$$ $E$are established. Moreover, we prove that$$\mathcal {E}$$ $E$has the property of matching boundary values on a domain$$\Omega \subseteq X$$ $\Omega \subseteq X$. This construction makes it possible to approximate harmonic functions (with respect to the Dirichlet form$$\mathcal {E}$$ $E$) on a domain inXwith a prescribed Lipschitz boundary data via a numerical scheme dictated by the approximating Dirichlet forms, which are discrete objects. 

   more » « less
2. Better Hardness Results for the Minimum Spanning Tree Congestion Problem

   https://doi.org/10.1007/s00453-024-01278-5  

   Luu, Huong; Chrobak, Marek (January 2025, Algorithmica)

   Abstract In the spanning tree congestion problem, given a connected graphG, the objective is to compute a spanning treeTinGthat minimizes its maximum edge congestion, where the congestion of an edgeeofTis the number of edges inGfor which the unique path inTbetween their endpoints traversese. The problem is known to be$$\mathbb{N}\mathbb{P}$$ $NP$-hard, but its approximability is still poorly understood, and it is not even known whether the optimum solution can be efficiently approximated with ratioo(n). In the decision version of this problem, denoted$${\varvec{K}-\textsf {STC}}$$ $K-\mathrm{STC}$, we need to determine ifGhas a spanning tree with congestion at mostK. It is known that$${\varvec{K}-\textsf {STC}}$$ $K-\mathrm{STC}$is$$\mathbb{N}\mathbb{P}$$ $NP$-complete for$$K\ge 8$$ $K\ge 8$, and this implies a lower bound of 1.125 on the approximation ratio of minimizing congestion. On the other hand,$${\varvec{3}-\textsf {STC}}$$ $3-\mathrm{STC}$can be solved in polynomial time, with the complexity status of this problem for$$K\in { \left\{ 4,5,6,7 \right\} }$$ $K\in \left(4,,,5,,,6,,,7\right)$remaining an open problem. We substantially improve the earlier hardness results by proving that$${\varvec{K}-\textsf {STC}}$$ $K-\mathrm{STC}$is$$\mathbb{N}\mathbb{P}$$ $NP$-complete for$$K\ge 5$$ $K\ge 5$. This leaves only the case$$K=4$$ $K=4$open, and improves the lower bound on the approximation ratio to 1.2. Motivated by evidence that minimizing congestion is hard even for graphs of small constant radius, we also consider$${\varvec{K}-\textsf {STC}}$$ $K-\mathrm{STC}$restricted to graphs of radius 2, and we prove that this variant is$$\mathbb{N}\mathbb{P}$$ $NP$-complete for all$$K\ge 6$$ $K\ge 6$. 

   more » « less
3. The two-photon exchange experiment at DESY

   https://doi.org/10.1140/epja/s10050-024-01299-2  

   Alarcon, R.; Beck, R.; Bernauer, J_C; Broering, M.; Christopher, A.; Cline, E_W; Dhital, S.; Dongwi, B.; Fernando, I.; Finger, M.; et al (April 2024, The European Physical Journal A)

   Abstract We propose a new measurement of the ratio of positron-proton to electron-proton elastic scattering at DESY. The purpose is to determine the contributions beyond single-photon exchange, which are essential for the Quantum Electrodynamic (QED) description of the most fundamental process in hadronic physics. By utilizing a 20 cm long liquid hydrogen target in conjunction with the extracted beam from the DESY synchrotron, we can achieve an average luminosity of$$2.12\times 10^{35}$$ $2.12\times {10}^{35}$ cm$$^{-2}\cdot $$ ${}^{-2}·$s$$^{-1}$$ ${}^{-1}$ ($$\approx 200$$ $\approx 200$times the luminosity achieved by OLYMPUS). The proposed two-photon exchange experiment (TPEX) entails a commissioning run at a beam energy of 2 GeV, followed by measurements at 3 GeV, thereby providing new data up to$$Q^2=4.6$$ $Q^2=4.6$ (GeV/c)$$^2$$ ${}^2$(twice the range of current measurements). We present and discuss the proposed experimental setup, run plan, and expectations. 

   more » « less
4. Spin density matrix elements in exclusive $$\rho ^0$$ meson muoproduction

   https://doi.org/10.1140/epjc/s10052-023-11359-4  

   Alexeev, G D; Alexeev, M G; Alice, C; Amoroso, A; Andrieux, V; Anosov, V; Augsten, K; Augustyniak, W; Azevedo, C_D R; Badelek, B; et al (October 2023, The European Physical Journal C)

   Abstract We report on a measurement of Spin Density Matrix Elements (SDMEs) in hard exclusive$$\rho ^0$$ ${\rho }^0$meson muoproduction at COMPASS using 160 GeV/cpolarised$$ \mu ^{+}$$ ${\mu }^{+}$and$$ \mu ^{-}$$ ${\mu }^{-}$beams impinging on a liquid hydrogen target. The measurement covers the kinematic range 5.0 GeV/$$c^2$$ $c^2$$$< W<$$ $<W<$17.0 GeV/$$c^2$$ $c^2$, 1.0 (GeV/c)$$^2$$ ${}^2$$$< Q^2<$$ $<Q^2<$10.0 (GeV/c)$$^2$$ ${}^2$and 0.01 (GeV/c)$$^2$$ ${}^2$$$< p_{\textrm{T}}^2<$$ $<p_{\text{T}}^2<$0.5 (GeV/c)$$^2$$ ${}^2$. Here,Wdenotes the mass of the final hadronic system,$$Q^2$$ $Q^2$the virtuality of the exchanged photon, and$$p_{\textrm{T}}$$ $p_{\text{T}}$the transverse momentum of the$$\rho ^0$$ ${\rho }^0$meson with respect to the virtual-photon direction. The measured non-zero SDMEs for the transitions of transversely polarised virtual photons to longitudinally polarised vector mesons ($$\gamma ^*_T \rightarrow V^{ }_L$$ ${\gamma }_T^{\ast }\to V_L^{}$) indicate a violation ofs-channel helicity conservation. Additionally, we observe a dominant contribution of natural-parity-exchange transitions and a very small contribution of unnatural-parity-exchange transitions, which is compatible with zero within experimental uncertainties. The results provide important input for modelling Generalised Parton Distributions (GPDs). In particular, they may allow one to evaluate in a model-dependent way the role of parton helicity-flip GPDs in exclusive$$\rho ^0$$ ${\rho }^0$production. 

   more » « less
5. 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