More Like this

1. Negative moments of the Riemann zeta-function

   https://doi.org/10.1515/crelle-2023-0091  

   Bui, Hung M; Florea, Alexandra (January 2024, Journal für die reine und angewandte Mathematik (Crelles Journal))

   Abstract Assuming the Riemann Hypothesis, we study negative moments of the Riemann zeta-function and obtain asymptotic formulas in certain ranges of the shift in $\zeta \left(s\right)${\zeta(s)}. For example, integrating ${\left|\zeta \left(\frac{1}{2}+\alpha +it\right)\right|}^{-2k}${|\zeta(\frac{1}{2}+\alpha+it)|^{-2k}}with respect totfromTto $2T${2T}, we obtain an asymptotic formula when the shift α is roughly bigger than $\frac{1}{\log T}${\frac{1}{\log T}}and $k<\frac{1}{2}${k<\frac{1}{2}}. We also obtain non-trivial upper bounds for much smaller shifts, as long as $\log \frac{1}{\alpha }\ll \log \log T${\log\frac{1}{\alpha}\ll\log\log T}. This provides partial progress towards a conjecture of Gonek on negative moments of the Riemann zeta-function, and settles the conjecture in certain ranges. As an application, we also obtain an upper bound for the average of the generalized Möbius function. 

   more » « less
2. Enumeration of Rooted Binary Unlabeled Galled Trees

   https://doi.org/10.1007/s11538-024-01270-8  

   Agranat-Tamir, Lily; Mathur, Shaili; Rosenberg, Noah A (May 2024, Bulletin of Mathematical Biology)

   Abstract Rooted binarygalledtrees generalize rooted binary trees to allow a restricted class of cycles, known asgalls. We build upon the Wedderburn-Etherington enumeration of rooted binary unlabeled trees withnleaves to enumerate rooted binary unlabeled galled trees withnleaves, also enumerating rooted binary unlabeled galled trees withnleaves andggalls,$$0 \leqslant g \leqslant \lfloor \frac{n-1}{2} \rfloor $$ $0⩽g⩽\lfloor \frac{n-1}{2}\rfloor$. The enumerations rely on a recursive decomposition that considers subtrees descended from the nodes of a gall, adopting a restriction on galls that amounts to considering only the rooted binarynormalunlabeled galled trees in our enumeration. We write an implicit expression for the generating function encoding the numbers of trees for alln. We show that the number of rooted binary unlabeled galled trees grows with$$0.0779(4.8230^n)n^{-\frac{3}{2}}$$ $0.0779(4.{8230}^n)n^{-\frac{3}{2}}$, exceeding the growth$$0.3188(2.4833^n)n^{-\frac{3}{2}}$$ $0.3188(2.{4833}^n)n^{-\frac{3}{2}}$of the number of rooted binary unlabeled trees without galls. However, the growth of the number of galled trees with only one gall has the same exponential order 2.4833 as the number with no galls, exceeding it only in the subexponential term,$$0.3910n^{\frac{1}{2}}$$ $0.3910n^{\frac{1}{2}}$compared to$$0.3188n^{-\frac{3}{2}}$$ $0.3188n^{-\frac{3}{2}}$. For a fixed number of leavesn, the number of gallsgthat produces the largest number of rooted binary unlabeled galled trees lies intermediate between the minimum of$$g=0$$ $g=0$and the maximum of$$g=\lfloor \frac{n-1}{2} \rfloor $$ $g=\lfloor \frac{n-1}{2}\rfloor$. We discuss implications in mathematical phylogenetics. 

   more » « less
3. Carleson’s $$\varepsilon ^{2}$$ conjecture in higher dimensions

   https://doi.org/10.1007/s00222-025-01337-w  

   Fleschler, Ian; Tolsa, Xavier; Villa, Michele (July 2025, Inventiones mathematicae)

   Abstract In this paper we prove a higher dimensional analogue of Carleson’s$$\varepsilon ^{2}$$ ${\epsilon }^2$conjecture. Given two arbitrary disjoint Borel sets$$\Omega ^{+},\Omega ^{-}\subset \mathbb{R}^{n+1}$$ ${\Omega }^{+},{\Omega }^{-}\subset R^{n+1}$, and$$x\in \mathbb{R}^{n+1}$$ $x\in R^{n+1}$,$$r>0$$ $r>0$, we denote$$ \varepsilon _{n}(x,r) := \frac{1}{r^{n}}\, \inf _{H^{+}} \mathcal{H}^{n} \left ( ((\partial B(x,r)\cap H^{+}) \setminus \Omega ^{+}) \cup (( \partial B(x,r)\cap H^{-}) \setminus \Omega ^{-})\right ), $$ ${\epsilon }_n(x,r):=\frac{1}{r^n}\underset{H^{+}}{inf}{H}^n\left(\right(\left(\partial B\right(x,r)\cap H^{+})\setminus {\Omega }^{+})\cup (\left(\partial B\right(x,r)\cap H^{-})\setminus {\Omega }^{-}\left)\right),$where the infimum is taken over all open affine half-spaces$$H^{+}$$ $H^{+}$such that$$x \in \partial H^{+}$$ $x\in \partial H^{+}$and we define$$H^{-}= \mathbb{R}^{n+1} \setminus \overline{H^{+}}$$ $H^{-}=R^{n+1}\setminus \overline{H^{+}}$. Our first main result asserts that the set of points$$x\in \mathbb{R}^{n+1}$$ $x\in R^{n+1}$where$$ \int _{0}^{1} \varepsilon _{n}(x,r)^{2} \, \frac{dr}{r}< \infty $$ ${\int }_0^1{\epsilon }_n{(x,r)}^2\frac{dr}{r}<\infty$is$$n$$ $n$-rectifiable. For our second main result we assume that$$\Omega ^{+}$$ ${\Omega }^{+}$,$$\Omega ^{-}$$ ${\Omega }^{-}$are open and that$$\Omega ^{+}\cup \Omega ^{-}$$ ${\Omega }^{+}\cup {\Omega }^{-}$satisfies the capacity density condition. For each$$x \in \partial \Omega ^{+} \cup \partial \Omega ^{-}$$ $x\in \partial {\Omega }^{+}\cup \partial {\Omega }^{-}$and$$r>0$$ $r>0$, we denote by$$\alpha ^{\pm }(x,r)$$ ${\alpha }^{\pm }(x,r)$the characteristic constant of the (spherical) open sets$$\Omega ^{\pm }\cap \partial B(x,r)$$ ${\Omega }^{\pm }\cap \partial B(x,r)$. We show that, up to a set of$$\mathcal{H}^{n}$$ $H^n$measure zero,$$x$$ $x$is a tangent point for both$$\partial \Omega ^{+}$$ $\partial {\Omega }^{+}$and$$\partial \Omega ^{-}$$ $\partial {\Omega }^{-}$if and only if$$ \int _{0}^{1} \min (1,\alpha ^{+}(x,r) + \alpha ^{-}(x,r) -2) \frac{dr}{r} < \infty . $$ ${\int }_0^{1}min(1,{\alpha }^{+}(x,r)+{\alpha }^{-}(x,r)-2)\frac{dr}{r}<\infty .$The first result is new even in the plane and the second one improves and extends to higher dimensions the$$\varepsilon ^{2}$$ ${\epsilon }^2$conjecture of Carleson. 

   more » « less
4. Measurement of non-prompt $${{\textrm{D}}^{0}}$$-meson elliptic flow in Pb–Pb collisions at $$\sqrt{s_{\textrm{NN}}} = 5.02$$ TeV

   https://doi.org/10.1140/epjc/s10052-023-12259-3  

   Acharya, S; Adamová, D; Aglieri_Rinella, G; Agnello, M; Agrawal, N; Ahammed, Z; Ahmad, S; Ahn, S U; Ahuja, I; Akindinov, A; et al (December 2023, The European Physical Journal C)

   Abstract The elliptic flow$$(v_2)$$ $\left(v_2\right)$of$${\textrm{D}}^{0}$$ ${\text{D}}^0$mesons from beauty-hadron decays (non-prompt$${\textrm{D}}^{0})$$ ${\text{D}}^0)$was measured in midcentral (30–50%) Pb–Pb collisions at a centre-of-mass energy per nucleon pair$$\sqrt{s_{\textrm{NN}}} = 5.02$$ $\sqrt{s_{\text{NN}}}=5.02$ TeV with the ALICE detector at the LHC. The$${\textrm{D}}^{0}$$ ${\text{D}}^0$mesons were reconstructed at midrapidity$$(|y|<0.8)$$ $\left(\right|y|<0.8)$from their hadronic decay$$\mathrm {D^0 \rightarrow K^-\uppi ^+}$$ $D^0\to K^{-}{\pi }^{+}$, in the transverse momentum interval$$2< p_{\textrm{T}} < 12$$ $2<p_{\text{T}}<12$ GeV/c. The result indicates a positive$$v_2$$ $v_2$for non-prompt$${{\textrm{D}}^{0}}$$ ${\text{D}}^0$mesons with a significance of 2.7$$\sigma $$ $\sigma$. The non-prompt$${{\textrm{D}}^{0}}$$ ${\text{D}}^0$-meson$$v_2$$ $v_2$is lower than that of prompt non-strange D mesons with 3.2$$\sigma $$ $\sigma$significance in$$2< p_\textrm{T} < 8~\textrm{GeV}/c$$ $2<p_{\text{T}}<8\text{GeV}/c$, and compatible with the$$v_2$$ $v_2$of beauty-decay electrons. Theoretical calculations of beauty-quark transport in a hydrodynamically expanding medium describe the measurement within uncertainties. 

   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