More Like this

1. Study of baryon number transport dynamics and strangeness conservation effects using Ω-hadron correlations

   https://doi.org/10.1007/s41365-024-01464-8  

   Dong, Wei-Jie; Yu, Xiao-Zhou; Ping, Si-Yuan; Wu, Xia-Tong; Wang, Gang; Huang, Huan-Zhong; Lin, Zi-Wei (July 2024, Nuclear Science and Techniques)

   Abstract In nuclear collisions at RHIC energies, an excess of$$\Omega$$ $\Omega$hyperons over$$\bar{\Omega }$$ $\overline{\Omega }$is observed, indicating that$$\Omega$$ $\Omega$has a net baryon number despitesand$$\bar{s}$$ $\overline{s}$quarks being produced in pairs. The baryon number in$$\Omega$$ $\Omega$may have been transported from the incident nuclei and/or produced in the baryon-pair production of$$\Omega$$ $\Omega$with other types of anti-hyperons such as$$\bar{\Xi }$$ $\overline{\Xi }$. To investigate these two scenarios, we propose to measure the correlations between$$\Omega$$ $\Omega$andKand between$$\Omega$$ $\Omega$and anti-hyperons. We use two versions, the default and string-melting, of a multiphase transport (AMPT) model to illustrate the method for measuring the correlation and to demonstrate the general shape of the correlation. We present the$$\Omega$$ $\Omega$-hadron correlations from simulated Au+Au collisions at$$\sqrt{s_\text{NN}} = 7.7$$ $\sqrt{s_{\text{NN}}}=7.7$and$$14.6 \ \textrm{GeV}$$ $14.6\text{GeV}$and discuss the dependence on the collision energy and on the hadronization scheme in these two AMPT versions. These correlations can be used to explore the mechanism of baryon number transport and the effects of baryon number and strangeness conservation on nuclear collisions. 

   more » « less
2. Characterizing the fundamental bending vibration of a linear polyatomic molecule for symmetry violation searches

   https://doi.org/10.1088/1367-2630/ace471  

   Jadbabaie, Arian; Takahashi, Yuiki; Pilgram, Nickolas H; Conn, Chandler J; Zeng, Yi; Zhang, Chi; Hutzler, Nicholas R (July 2023, New Journal of Physics)

   Abstract Polyatomic molecules have been identified as sensitive probes of charge-parity violating and parity violating physics beyond the Standard Model (BSM). For example, many linear triatomic molecules are both laser-coolable and have parity doublets in the ground electronic $\tilde{X}{}^2{\mathrm{\Sigma }}^{+}\left(010\right)$state arising from the bending vibration, both features that can greatly aid BSM searches. Understanding the $\tilde{X}{}^2{\mathrm{\Sigma }}^{+}\left(010\right)$state is a crucial prerequisite to precision measurements with linear polyatomic molecules. Here, we characterize the fundamental bending vibration of ${}^{174}$YbOH using high-resolution optical spectroscopy on the nominally forbidden $\tilde{X}{}^2{\mathrm{\Sigma }}^{+}\left(010\right)$ $\to \tilde{A}{}^2{\mathrm{\Pi }}_{1/2}\left(000\right)$transition at 588 nm. We assign 39 transitions originating from the lowest rotational levels of the $\tilde{X}{}^2{\mathrm{\Sigma }}^{+}\left(010\right)$state, and accurately model the state’s structure with an effective Hamiltonian using best-fit parameters. Additionally, we perform Stark and Zeeman spectroscopy on the $\tilde{X}{}^2{\mathrm{\Sigma }}^{+}\left(010\right)$state and fit the molecule-frame dipole moment to $D_{\mathrm{m}\mathrm{o}\mathrm{l}}=2.16\left(1\right)$Dand the effective electrong-factor to $g_S=2.07\left(2\right)$. Further, we use an empirical model to explain observed anomalous line intensities in terms of interference from spin–orbit and vibronic perturbations in the excited $\tilde{A}{}^2{\mathrm{\Pi }}_{1/2}\left(000\right)$state. Our work is an essential step toward searches for BSM physics in YbOH and other linear polyatomic molecules. 

   more » « less
3. On an Equivalence of Divisors on $$\overline {\text {M}}_{0,n}$$ from Gromov-Witten Theory and Conformal Blocks

   https://doi.org/10.1007/s00031-022-09752-6  

   Chen, L.; Gibney, A.; Heller, L.; Kalashnikov, E.; Larson, H.; Xu, W. (August 2022, Transformation Groups)

   Abstract We consider a conjecture that identifies two types of base point free divisors on$$\overline {\text {M}}_{0,n}$$ ${\overline{M}}_{0,n}$. The first arises from Gromov-Witten theory of a Grassmannian. The second comes from first Chern classes of vector bundles associated with simple Lie algebras in type A. Here we reduce this conjecture on$$\overline {\text {M}}_{0,n}$$ ${\overline{M}}_{0,n}$to the same statement forn= 4. A reinterpretation leads to a proof of the conjecture on$$\overline {\text {M}}_{0,n}$$ ${\overline{M}}_{0,n}$for a large class, and we give sufficient conditions for the non-vanishing of these divisors. 

   more » « less
4. Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity

   https://doi.org/10.1007/s00453-023-01102-6  

   Akmal, Shyan; Chen, Lijie; Jin, Ce; Raj, Malvika; Williams, Ryan (February 2023, Algorithmica)

   Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:Certifying that a list ofnintegers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$ $\tilde{O}\left(n\right)$. Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$time).Counting the number ofk-cliques with total edge weight equal to zero in ann-node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$ $\tilde{O}\left(n^{\lceil k/2\rceil }\right)$(where$$k\ge 3$$ $k\ge 3$). For oddk, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm-edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$ $\tilde{O}\left(m\right)$. Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only countk-cliques in unweighted graphs, and had worse running times for smallk.Computing the All-Pairs Shortest Distances matrix for ann-node graph can be done in Merlin–Arthur time$$\tilde{O}(n^2)$$ $\tilde{O}\left(n^2\right)$. Note this is optimal, as the matrix can have$$\Omega (n^2)$$ $\Omega \left(n^2\right)$nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an$$\tilde{O}(n^{2.94})$$ $\tilde{O}\left(n^{2.94}\right)$nondeterministic time algorithm.Certifying that ann-variablek-CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$ $2^{n/2-n/O\left(k\right)}$. We also observe an algebrization barrier for the previous$$2^{n/2}\cdot \textrm{poly}(n)$$ $2^{n/2}·\text{poly}\left(n\right)$-time Merlin–Arthur protocol of R. Williams [CCC’16] for$$\#$$ $\#$SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol fork-UNSAT running in$$2^{n/2}/n^{\omega (1)}$$ $2^{n/2}/n^{\omega \left(1\right)}$time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time$$2^{4n/5}\cdot \textrm{poly}(n)$$ $2^{4n/5}·\text{poly}\left(n\right)$. Previously, the only nontrivial result known along these lines was an Arthur–Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{2n/3}\cdot \textrm{poly}(n)$$ $2^{2n/3}·\text{poly}\left(n\right)$time.Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution tonintegers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$ $2^{n/3}·\text{poly}\left(n\right)$, improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{0.49991n}\cdot \textrm{poly}(n)$$ $2^{0.49991n}·\text{poly}\left(n\right)$time. 

   more » « less
5. The half-volume spectrum of a manifold

   https://doi.org/10.1007/s00526-025-02949-z  

   Mazurowski, Liam; Zhou, Xin (May 2025, Calculus of Variations and Partial Differential Equations)

   Abstract We define the half-volume spectrum$$\{{\tilde{\omega }_p\}_{p\in \mathbb {N}}}$$ $\{{\tilde{\omega }}_p{\}}_{p\in N}$of a closed manifold$$(M^{n+1},g)$$ $(M^{n+1},g)$. This is analogous to the usual volume spectrum ofM, except that we restrict top-sweepouts whose slices each enclose half the volume ofM. We prove that the Weyl law continues to hold for the half-volume spectrum. We define an analogous half-volume spectrum$$\tilde{c}(p)$$ $\tilde{c}\left(p\right)$in the phase transition setting. Moreover, for$$3 \le n+1 \le 7$$ $3\le n+1\le 7$, we use the Allen–Cahn min-max theory to show that each$$\tilde{c}(p)$$ $\tilde{c}\left(p\right)$is achieved by a constant mean curvature surface enclosing half the volume ofMplus a (possibly empty) collection of minimal surfaces with even multiplicities. 

   more » « less